|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 18 occurrences of 11 keywords
|
|
|
Results
Found 17 publication records. Showing 17 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
59 | Philippe Chapdelaine, Nadia Creignou |
The complexity of Boolean constraint satisfaction local search problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 43(1), pp. 51-63, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
PLS-complete, optimization, complexity, local search, satisfiability, PLS |
56 | Alexander Skopalik, Berthold Vöcking |
Inapproximability of pure nash equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 355-364, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximation, local search, congestion games |
29 | Anand Bhalgat, Tanmoy Chakraborty 0001, Sanjeev Khanna |
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), Cambridge, Massachusetts, USA, June 7-11, 2010, pp. 73-82, 2010, ACM, 978-1-60558-822-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
cut games, party affiliation games, potential games, pure nash equilibrium, approximation algorithms |
29 | Juliane Dunkel, Andreas S. Schulz |
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings, pp. 62-73, 2006, Springer, 3-540-68138-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Sophie Fischer, Leen Torenvliet |
The Malleability of TSP_{2Opt}. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG '95, Aachen, Germany, June 20-22, 1995, Proceedings, pp. 152-166, 1995, Springer, 3-540-60618-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
27 | James B. Orlin, Abraham P. Punnen, Andreas S. Schulz |
Integer Programming: Optimization and Evaluation Are Equivalent. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings, pp. 519-529, 2009, Springer, 978-3-642-03366-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Heiner Ackermann, Heiko Röglin, Berthold Vöcking |
On the impact of combinatorial structure on congestion games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 55(6), pp. 25:1-25:22, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
convergence, local search, Nash equilibria, Congestion games |
27 | Heiner Ackermann, Heiko Röglin, Berthold Vöcking |
On the Impact of Combinatorial Structure on Congestion Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 613-622, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Tobias Tscheuschner |
The local max-cut problem is PLS-complete even on graphs with maximum degree five ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1004.5329, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
24 | Dominic Dumrauf, Burkhard Monien, Karsten Tiemann |
MultiProcessor Scheduling is PLS-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS ![In: 42st Hawaii International International Conference on Systems Science (HICSS-42 2009), Proceedings (CD-ROM and online), 5-8 January 2009, Waikoloa, Big Island, HI, USA, pp. 1-10, 2009, IEEE Computer Society, 978-0-7695-3450-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Heiner Ackermann, Alexander Skopalik |
On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings, pp. 419-430, 2007, Springer, 978-3-540-77104-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Felix Brandt 0001, Felix A. Fischer, Markus Holzer 0001 |
Symmetries and the Complexity of Pure Nash Equilibrium. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 212-223, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
14 | Tanmoy Chakraborty 0001, Sanjeev Khanna |
Nash Dynamics in Constant Player and Bounded Jump Congestion Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGT ![In: Algorithmic Game Theory, Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings, pp. 196-207, 2009, Springer, 978-3-642-04644-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
14 | Xin Ai 0002, Vikram Srinivasan, Chen-Khong Tham |
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 26(7), pp. 1170-1182, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
14 | Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking |
Computing Approximate Nash Equilibria in Network Congestion Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity, 15th International Colloquium, SIROCCO 2008, Villars-sur-Ollon, Switzerland, June 17-20, 2008, Proceedings, pp. 209-220, 2008, Springer, 978-3-540-69326-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
14 | Steve Chien, Alistair Sinclair |
Convergence to approximate Nash equilibria in congestion games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 169-178, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
14 | Alex Fabrikant, Christos H. Papadimitriou, Kunal Talwar |
The complexity of pure Nash equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 604-612, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
PLS-completeness, pure Nash equilibria, complexity, games, local search, congestion games, PLS |
Displaying result #1 - #17 of 17 (100 per page; Change: )
|
|