Structure and complexity of extreme Nash equilibria
- 1 October 2005
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 343 (1-2), 133-157
- https://doi.org/10.1016/j.tcs.2005.05.011
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Approximate Equilibria and Ball FusionTheory of Computing Systems, 2003
- On the complexity of price equilibriaJournal of Computer and System Sciences, 2003
- Which Is the Worst-Case Nash Equilibrium?Lecture Notes in Computer Science, 2003
- The price of selfish routingPublished by Association for Computing Machinery (ACM) ,2001
- Improving local search heuristics for some scheduling problems. Part IIDiscrete Applied Mathematics, 1997
- Using dual approximation algorithms for scheduling problems theoretical and practical resultsJournal of the ACM, 1987
- Expected Length of the Longest Probe Sequence in Hash Code SearchingJournal of the ACM, 1981
- A linear time approximation algorithm for multiprocessor schedulingBIT Numerical Mathematics, 1979
- Exact and Approximate Algorithms for Scheduling Nonidentical ProcessorsJournal of the ACM, 1976
- Complexity Results for Multiprocessor Scheduling under Resource ConstraintsSIAM Journal on Computing, 1975