|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9 occurrences of 7 keywords
|
|
|
Results
Found 9 publication records. Showing 9 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
39 | Xi Chen 0001, Xiaotie Deng, Shang-Hua Teng |
Settling the complexity of computing two-player Nash equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(3), pp. 14:1-14:57, 2009. The full citation details ...](Pics/full.jpeg) |
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 |
39 | Xi Chen 0001, Decheng Dai, Ye Du, Shang-Hua Teng |
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 273-282, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Arrow-Debreu markets, PPAD-completeness, Computational complexity |
39 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg |
Nash equilibria in graphical games on trees revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), Ann Arbor, Michigan, USA, June 11-15, 2006, pp. 100-109, 2006, ACM, 1-59593-236-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
PPAD-completeness, nash equilibrium, graphical games |
39 | Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou |
The complexity of computing a Nash equilibrium. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 71-78, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
PPAD-completeness, complexity, game theory, Nash equilibrium |
37 | Alexander Grishutin, Daniil Musatov |
Discrete Versions of the KKM Lemma and Their PPAD-Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 - July 1, 2022, Proceedings, pp. 170-189, 2022, Springer, 978-3-031-09573-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
37 | Tamás Király, Júlia Pap |
PPAD-completeness of polyhedral versions of Sperner's Lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 313(15), pp. 1594-1599, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
37 | Paul W. Goldberg |
A Survey of PPAD-Completeness for Computing Nash Equilibria ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1103.2709, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
24 | Elad Hazan, Robert Krauthgamer |
How hard is it to approximate the best Nash equilibrium? ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 720-727, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye 0001 |
Leontief economies encode nonzero sum two-player games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 659-667, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #9 of 9 (100 per page; Change: )
|
|