|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9 occurrences of 7 keywords
|
|
|
|
|
Results
Found 7 publication records. Showing 7 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Paul W. Goldberg |
A Survey of PPAD-Completeness for Computing Nash Equilibria  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Xi Chen, Xiaotie Deng, Shang-Hua Teng |
Settling the complexity of computing two-player Nash equilibria. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
Arrow-Debreu market, Brouwer's fixed point, Lemke-Howson algorithm, PPAD-completeness, Sperner's lemma, Nash equilibrium, smoothed analysis, Two-player game |
| 1 | Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng |
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Arrow-Debreu markets, PPAD-completeness, Computational complexity |
| 1 | Elad Hazan, Robert Krauthgamer |
How hard is it to approximate the best Nash equilibrium? |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg |
Nash equilibria in graphical games on trees revisited. |
ACM Conference on Electronic Commerce |
2006 |
DBLP DOI BibTeX RDF |
PPAD-completeness, nash equilibrium, graphical games |
| 1 | Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou |
The complexity of computing a Nash equilibrium. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
PPAD-completeness, complexity, game theory, Nash equilibrium |
| 1 | Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye |
Leontief economies encode nonzero sum two-player games. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #7 of 7 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")