How Hard is Competition for Rank?

Add to your list(s) Download to your calendar using vCal

• Prof. Paul Goldberg, Computer Science Department, University of Liverpool
• Monday 06 December 2010, 16:00-17:00
• UG40, School of Computer Science.

If you have a question about this talk, please contact Leandro Minku.

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.

This talk is part of the Artificial Intelligence and Natural Computation seminars series.

This talk is included in these lists:

• Artificial Intelligence and Natural Computation seminars
• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• UG40, School of Computer Science
• computer sience

Note that ex-directory lists are not shown.