![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Paul Goldberg, University of Liverpool
Thursday 09 December 2010, 16:00-17:00
How Hard is Competition for Rank?
- đ¤ Speaker: Paul Goldberg, University of Liverpool
- đ Date & Time: Thursday 09 December 2010, 16:00 - 17:00
- đ Venue: Small lecture theatre, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge
Abstract
Competition for rank occurs whenever the outcome is a ranking, or league table, of the competitors. One can note that it is widespread throughout the plant and animal kingdoms, politics, higher education, and artificial contests. In the talk, I will describe a class of games that capture important aspects of this type of competition, and consider the problem of computing their Nash equilibria. An important background fact that motivated this study is the hardness of computing Nash equilibria of unrestricted games, which raises interest in more specific types of game for which the computational problem is tractable. I will also give a general overview of these hardness results, and how they arise.
Series This talk is part of the Microsoft Research Cambridge, public talks series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge talks
- Chris Davis' list
- Guy Emerson's list
- Interested Talks
- Microsoft Research Cambridge, public talks
- ndk22's list
- ob366-ai4er
- Optics for the Cloud
- personal list
- PMRFPS's
- rp587
- School of Technology
- Small lecture theatre, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.