Timeline for Outstanding conjectures and open problems in (algorithmic) game theory?
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 2, 2010 at 23:42 | comment | added | Rahul Savani | Computing a pure Nash equilibrium of a general congestion game is PLS-complete, so an efficient algorithm is unlikely to exist. | |
| Sep 26, 2010 at 19:40 | comment | added | daveagp | The recent survey is very helpful. I had actually looked at Nisan+++'s book --- a text search for "conjecture" gives only a couple of hits! --- but there are indeed a lot of open problems. Any specific conjectures, or less technical specific open problems, would still be welcomed in my search. | |
| Sep 26, 2010 at 19:39 | vote | accept | daveagp | ||
| Sep 25, 2010 at 7:17 | history | edited | Mohammad Al-Turkistany | CC BY-SA 2.5 |
corrected grammar
|
| Sep 25, 2010 at 7:12 | history | edited | Mohammad Al-Turkistany | CC BY-SA 2.5 |
improved formatting
|
| Sep 25, 2010 at 7:01 | history | edited | Mohammad Al-Turkistany | CC BY-SA 2.5 |
added details
|
| Sep 25, 2010 at 6:44 | history | edited | Mohammad Al-Turkistany | CC BY-SA 2.5 |
added details
|
| Sep 25, 2010 at 6:22 | history | answered | Mohammad Al-Turkistany | CC BY-SA 2.5 |