BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of California\, Berkeley//UCB Events Calendar//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
DTSTART:19701029T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:19700402T020000
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20180125T180359Z
DTSTART;TZID=America/Los_Angeles:20180205T153000
DTEND;TZID=America/Los_Angeles:20180205T170000
TRANSP:OPAQUE
SUMMARY:Wenpin Tang - Optimal Surviving Strategy For The Up The River Problem
UID:115023-ucb-events-calendar@berkeley.edu
ORGANIZER;CN="UC Berkeley Calendar Network":
LOCATION:3108 Etcheverry Hall
DESCRIPTION:Wenpin Tang\, UCLA\n\nAbstract:\n\nNowadays there are more and more people living on the planet\, but the available resources are very limited. So an interesting question is how to allocate the limited resources to maximize our welfare.\n\nIn this talk\, I will present the "Up the River problem" which is a dynamic allocation model in a random environment with limited resources. The model was introduced by David Aldous in 2000\, along with a couple of open problems. A unit drift is distributed among a finite collection of Brownian particles on R+\, which are annihilated once they reach the origin. Starting K particles at x = 1\, we prove Aldous' conjecture that the push-the-laggard strategy of distributing the drift asymptotically (as K → ∞) maximizes the total number of surviving particles\, with approximately √ 4 π K1/2 surviving particles. The solution to the problem relies on stochastic calculus and partial differential equations: the hydrodynamic limit of the particle density satisfies a two-phase partial differential equations\, one with a fix boundary and the other with a free boundary.\n\nAt the end of the talk\, I will discuss recent progress in continuous-time information search model\, initiated by Ke and Villas-Boas. The techniques in solving the "Up the River problem" can also be applied to these search models. The talk is based on joint work with Li-Cheng Tsai (Up the River problem)\, Tony Ke and J.Miguel Villas-Boas \n\nBio: Wenpin Tang is an Assistant Professor at Department of Mathematics\, UCLA. He obtained his Ph.D. from Department of Statistics\, UC Berkeley. His advisor was Jim Pitman. Before coming to Berkeley\, he obtained an engineer diploma (Diplôme d'ingénieur) from Ecole Polytechnique\, France.\n\nResearch: Tang's research interests include probability theory and its applications. He has been working on paths embedding in Brownian motion (with Jim Pitman)\, and paths intersection of Brownian motion (with Steve Evans and Jim Pitman). He also solved a conjecture of David Aldous on Up the River problem (with Li-Cheng Tsai). \n\nMore generally\, he is interested in topics such as random combinatorial objects\, stochastic differential equations\, and interacting particle systems.\n\nMore information can be found on his website here: http://www.math.ucla.edu/~wenpintang/
URL:http://events.berkeley.edu/index.php/calendar/sn/pubaff.html?event_ID=115023&view=preview
SEQUENCE:0
CLASS:PUBLIC
CREATED:20180125T180359Z
LAST-MODIFIED:20180131T211453Z
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-OWNERAPPTID:-1
END:VEVENT
END:VCALENDAR