On 28th November OxTalks will move to the new Halo platform and will become 'Oxford Events' (full details are available on the Staff Gateway).
There will be an OxTalks freeze beginning on Friday 14th November. This means you will need to publish any of your known events to OxTalks by then as there will be no facility to publish or edit events in that fortnight. During the freeze, all events will be migrated to the new Oxford Events site. It will still be possible to view events on OxTalks during this time.
If you have any questions, please contact halo@digital.ox.ac.uk
Consider the following simple 2-person sequential game with i.i.d. payoffs. The 2 players, Max and Average, each have exactly 2 options for each
move. Max plays optimally, i.e., to maximize her payoff, and Average plays randomly. How does the expected payoff for Max depend on the distribution on payoffs?
I will describe the complexity-theoretic motivation for this question, and describe some preliminary results when the distribution on payoffs is Bernoulli.
Joint work with Andy Drucker.
