BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:How Hard is Competition for Rank? - Paul Goldberg\, University of 
 Liverpool
DTSTART:20101209T160000Z
DTEND:20101209T170000Z
UID:TALK28227@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION: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 th
 at capture important aspects of this type of competition\, and consider th
 e 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 gene
 ral overview of these hardness results\, and how they arise.
LOCATION:Small lecture theatre\, Microsoft Research Ltd\, 7 J J Thomson Av
 enue (Off Madingley Road)\, Cambridge
END:VEVENT
END:VCALENDAR