BEGIN:VCALENDAR
VERSION:2.0
PRODID:talks.ox.ac.uk
BEGIN:VEVENT
SUMMARY:Max-Average Games with Random Payoffs - Rahul Santhanam (Departmen
t of Computer Science\, University of Oxford)
DTSTART;VALUE=DATE-TIME:20180430T120000
DTEND;VALUE=DATE-TIME:20180430T130000
UID:https://talks.ox.ac.uk/talks/id/2c8a4425-8850-49f9-b3d4-33d4d5e92550/
DESCRIPTION:Consider the following simple 2-person sequential game with i.
i.d. payoffs. The 2 players\, Max and Average\, each have exactly 2 option
s for each\nmove. Max plays optimally\, i.e.\, to maximize her payoff\, an
d Average plays randomly. How does the expected payoff for Max depend on t
he distribution on payoffs?\n\nI will describe the complexity-theoretic mo
tivation for this question\, and describe some preliminary results when th
e distribution on payoffs is Bernoulli.\n\nJoint work with Andy Drucker.\n
Speakers:\nRahul Santhanam (Department of Computer Science\, University of
Oxford)
LOCATION:Mathematical Institute (L4)\, Woodstock Road OX2 6GG
TZID:Europe/London
URL:https://talks.ox.ac.uk/talks/id/2c8a4425-8850-49f9-b3d4-33d4d5e92550/
BEGIN:VALARM
ACTION:display
DESCRIPTION:Talk:Max-Average Games with Random Payoffs - Rahul Santhanam (
Department of Computer Science\, University of Oxford)
TRIGGER:-PT1H
END:VALARM
END:VEVENT
END:VCALENDAR