Loading...
Please wait, while we are loading the content...
Similar Documents
CMSC 858 F : Algorithmic Game Theory Fall 2010 Complexity of finding Nash equilibrium : PPAD completeness results Instructor
| Content Provider | Semantic Scholar |
|---|---|
| Author | Hajiaghayi, Mohammad Taghi Sarpatwar, Kanthi Kiran |
| Copyright Year | 2010 |
| Abstract | Nash’s theorem guarantees the presence of mixed nash equilibrium in every finite game. We are concerned here with the problem of finding such an equilibrium efficiently. In other words, does there exist an algorithm to find the mixed nash equilibrium in polynomial time? The answer to this question is not known but it is known finding mixed Nash equilibrium is PPAD complete, which implies some sort of hardness. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.cs.umd.edu/~hajiagha/AGT10/scribe-27-10-2010.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |