![[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)
Arno Pauly, University of Cambridge
Friday 22 October 2010, 16:00-17:00
Algorithmic Game Theory
- 👤 Speaker: Arno Pauly, University of Cambridge
- 📅 Date & Time: Friday 22 October 2010, 16:00 - 17:00
- 📍 Venue: LT1, Computer Laboratory, William Gates Builiding
Questions? Contact
Nishanth Sastry
Abstract
What is a game? What are Nash equilibria? How can they be computed? This would include a brief introduction of complexity classes such as PPAD and PLS , as well as the basic solution concepts of game theory.
Series This talk is part of the Current Research Topics (Computer Laboratory) 2010-11 series.
Included in Lists
- Current Research Topics (Computer Laboratory) 2010-11
- LT1, Computer Laboratory, William Gates Builiding
Note: Ex-directory lists are not shown.