Search results for "PPAD-completeness"

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.	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
39	Xi Chen 0001, 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
39	Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg	Nash equilibria in graphical games on trees revisited.	EC	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.	STOC	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.	CSR	2022	DBLP DOI BibTeX RDF
37	Tamás Király, Júlia Pap	PPAD-completeness of polyhedral versions of Sperner's Lemma.	Discret. Math.	2013	DBLP DOI BibTeX RDF
37	Paul W. Goldberg	A Survey of PPAD-Completeness for Computing Nash Equilibria	CoRR	2011	DBLP BibTeX RDF
24	Elad Hazan, Robert Krauthgamer	How hard is it to approximate the best Nash equilibrium?	SODA	2009	DBLP DOI BibTeX RDF
24	Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye 0001	Leontief economies encode nonzero sum two-player games.	SODA	2006	DBLP DOI BibTeX RDF

Displaying result #1 - #9 of 9 (100 per page; Change: )