{"178971":{"#nid":"178971","#data":{"type":"event","title":"Sheldon Ross, University of Southern California","body":[{"value":"\u003Cp\u003E\u003Cstrong\u003ESpeaker\u003C\/strong\u003E\u003C\/p\u003E\u003Cp\u003ESheldon Ross\u003Cbr \/\u003EEpstein Chair Professor\u003Cbr \/\u003EIndustrial and Systems Engineering\u003Cbr \/\u003EUniversity of Southern California\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003EAbstract\u003C\/strong\u003E\u003C\/p\u003E\u003Cp\u003ESuppose there are r gamblers, with gambler i initially having a fortune of ni. In our first model we suppose that at each stage two of the gamblers are chosen to play a game, equally likely to be won by either player, with the winner of the game receiving 1 from the loser. Any gambler whose fortune becomes 0 leaves, and this continues until there is only a single gambler left. We are interested in the probability that player i is the one left, and in the the mean number of games played between specified players i and j. In our second model we suppose that all remaining players contribute 1 to a pot, which is equally likely to be won by each of them. The problem here is to determine the expected number of games played until one player has all the funds.\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"\u003Cp\u003ESuppose there are r gamblers, with gambler i initially having a fortune of ni. In our first model we suppose that at each stage two of the gamblers are chosen to play a game, equally likely to be won by either player, with the winner of the game receiving 1 from the loser. Any gambler whose fortune becomes 0 leaves, and this continues until there is only a single gambler left. We are interested in the probability that player i is the one left, and in the the mean number of games played between specified players i and j. In our second model we suppose that all remaining players contribute 1 to a pot, which is equally likely to be won by each of them. The problem here is to determine the expected number of games played until one player has all the funds.\u003C\/p\u003E","format":"limited_html"}],"field_summary_sentence":[{"value":"Joint Statistics\/OR Colloquium Some Multiple Player Gambler\u0027s Ruin Problems"}],"uid":"27215","created_gmt":"2012-12-20 15:47:51","changed_gmt":"2016-10-08 02:01:40","author":"Mike Alberghini","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2010-03-16T12:00:00-04:00","event_time_end":"2010-03-16T13:00:00-04:00","event_time_end_last":"2010-03-16T13:00:00-04:00","gmt_time_start":"2010-03-16 16:00:00","gmt_time_end":"2010-03-16 17:00:00","gmt_time_end_last":"2010-03-16 17:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"1242","name":"School of Industrial and Systems Engineering (ISYE)"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"1795","name":"Seminar\/Lecture\/Colloquium"}],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003E\u003Cspan\u003ETon Dieker, ISyE\u003C\/span\u003E\u003Cbr \/\u003E\u003Ca href=\u0022http:\/\/www.gatech.edu\/contact\/?id=e5011\u0022\u003EContact Ton Dieker\u003C\/a\u003E\u003Cbr \/\u003E\u003Cspan\u003E404-385-3140\u003C\/span\u003E\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}}}