Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Finding minimum-cost circulations by successive approximation
Mathematics of Operations Research
Simple local search problems that are hard to solve
SIAM Journal on Computing
The complexity of the Lin-Kernighan heuristic for the traveling salesman problem
SIAM Journal on Computing
On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Coordination complexity of parallel price-directive decomposition
Mathematics of Operations Research
Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
SIAM Journal on Computing
Journal of the ACM (JACM)
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Approximate local search in combinatorial optimization
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Complexity results about Nash equilibria
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Selfish caching in distributed systems: a game-theoretic analysis
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Computing correlated equilibria in multi-player games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The Price of Routing Unsplittable Flow
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fairness and optimality in congestion games
Proceedings of the 6th ACM conference on Electronic commerce
Computing equilibria in multi-player games
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Selfish routing with incomplete information
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Nash Equilibria in Random Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Sink Equilibria and Convergence
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Reducibility among equilibrium problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The effect of collusion in congestion games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Fast convergence to Wardrop equilibria by adaptive sampling methods
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Welfare maximization in congestion games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Non-cooperative multicast and facility location games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Playing games in many possible worlds
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
On the topologies formed by selfish peers
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Computing equilibria for a service provider game with (Im)perfect information
ACM Transactions on Algorithms (TALG)
Algorithms for pure Nash equilibria in weighted congestion games
Journal of Experimental Algorithmics (JEA)
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
On the convergence of multicast games in directed networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Congestion games with load-dependent failures: identical resources
Proceedings of the 8th ACM conference on Electronic commerce
Convergence to approximate Nash equilibria in congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A joint selfish routing and channel assignment game in wireless mesh networks
Computer Communications
Fast-converging tatonnement algorithms for one-time and ongoing market problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Inapproximability of pure nash equilibria
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Graphical congestion games with linear latencies
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Computing correlated equilibria in multi-player games
Journal of the ACM (JACM)
Atomic congestion games among coalitions
ACM Transactions on Algorithms (TALG)
The complexity of uniform Nash equilibria and related regular subgraph problems
Theoretical Computer Science
Fast convergence to nearly optimal solutions in potential games
Proceedings of the 9th ACM conference on Electronic commerce
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
On Satisfiability Games and the Power of Congestion Games
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Computing Approximate Nash Equilibria in Network Congestion Games
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
On the impact of combinatorial structure on congestion games
Journal of the ACM (JACM)
On domination game analysis for microeconomic data mining
ACM Transactions on Knowledge Discovery from Data (TKDD)
The Search for Equilibrium Concepts
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Atomic Congestion Games: Fast, Myopic and Concurrent
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
The Price of Stochastic Anarchy
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
On the complexity of Nash equilibria of action-graph games
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Efficient coordination mechanisms for unrelated machine scheduling
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Symmetries and the complexity of pure Nash equilibrium
Journal of Computer and System Sciences
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
How Hard Is It to Find Extreme Nash Equilibria in Network Congestion Games?
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
On the Road to $\mathcal{PLS}$-Completeness: 8 Agents in a Singleton Congestion Game
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
An Efficient PTAS for Two-Strategy Anonymous Games
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Improving the Efficiency of Load Balancing Games through Taxes
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Malicious Bayesian Congestion Games
Approximation and Online Algorithms
$\mathcal{NP}$-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Model checking nash equilibria in MAD distributed systems
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Pure Nash equilibria in player-specific and weighted congestion games
Theoretical Computer Science
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
On the complexity of nash dynamics and sink equilibria
Proceedings of the 10th ACM conference on Electronic commerce
Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Management of Variable Data Streams in Networks
Algorithmics of Large and Complex Networks
The structure and complexity of Nash equilibria for a selfish routing game
Theoretical Computer Science
Theoretical Computer Science
Strong and Pareto Price of Anarchy in Congestion Games
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Concurrent imitation dynamics in congestion games
Proceedings of the 28th ACM symposium on Principles of distributed computing
On the complexity of constrained Nash equilibria in graphical games
Theoretical Computer Science
Mathematics of Operations Research
Integer Programming: Optimization and Evaluation Are Equivalent
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Graph Theory, Computational Intelligence and Thought
Fast and compact: a simple class of congestion games
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Pure Nash equilibria: hard and easy games
Journal of Artificial Intelligence Research
How hard is it to find extreme Nash equilibria in network congestion games?
Theoretical Computer Science
The price of stability in selfish scheduling games
Web Intelligence and Agent Systems
How to find Nash equilibria with extreme total latency in network congestion games?
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Congestion games with resource reuse and applications in spectrum sharing
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Congestion games: equilibria, convergence and complexity
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Computational Aspects of Equilibria
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Characterizing the Existence of Potential Functions in Weighted Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Nash Dynamics in Constant Player and Bounded Jump Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Games with Congestion-Averse Utilities
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Performances of One-Round Walks in Linear Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Approximate Pure Nash Equilibria via Lovász Local Lemma
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Covering Games: Approximation through Non-cooperation
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
The Impact of Social Ignorance on Weighted Congestion Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Nash Dynamics in Congestion Games with Similar Resources
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Strong Nash Equilibria in Games with the Lexicographical Improvement Property
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On the Impact of Strategy and Utility Structures on Congestion-Averse Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On Strong Equilibria in the Max Cut Game
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Symmetries and the complexity of pure Nash equilibrium
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Algorithms for playing games with limited randomness
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A unified approach to congestion games and two-sided markets
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
On the performance of congestion games for optimum satisfiability problems
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
On the complexity of pure Nash equilibria in player-specific network congestion games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Weighted Boolean formula games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Communications of the ACM
Myopic distributed protocols for singleton and independent-resource congestion games
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Computing pure strategy nash equilibria in compact symmetric games
Proceedings of the 11th ACM conference on Electronic commerce
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Proceedings of the 11th ACM conference on Electronic commerce
Dynamics in network interaction games
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Congestion-based pricing resource management in broadband wireless networks
IEEE Transactions on Wireless Communications
On the complexity of local search for weighted standard set problems
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Local search: simple, successful, but sometimes sluggish
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Computing pure Nash and strong equilibria in bottleneck congestion games
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Computational game theory: an introduction
Algorithms and theory of computation handbook
On the packing of selfish items
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Network uncertainty in selfish routing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
On the complexity of pareto-optimal nash and strong equilibria
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
The limits of smoothness: a primal-dual framework for price of anarchy bounds
WINE'10 Proceedings of the 6th international conference on Internet and network economics
The complexity of equilibria in cost sharing games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Strategic multiway cut and multicut games
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Hierarchy decomposition for faster user equilibria on road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Equilibria problems on games: Complexity versus succinctness
Journal of Computer and System Sciences
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Settling the complexity of local max-cut (almost) completely
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Computing stable outcomes in hedonic games with voting-based deviations
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Convergence method, properties and computational complexity for Lyapunov games
International Journal of Applied Mathematics and Computer Science - SPECIAL SECTION: Efficient Resource Management for Grid-Enabled Applications
Peer-assisted texture streaming in metaverses
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods
SIAM Journal on Computing
Pure nash equilibria in player-specific and weighted congestion games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
On the complexity of pure-strategy nash equilibria in congestion and local-effect games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
The equilibrium existence problem in finite network congestion games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Rational Generating Functions and Integer Programming Games
Operations Research
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Convergence and approximation in potential games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Nash equilibria, the price of anarchy and the fully mixed nash equilibrium conjecture
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the price of anarchy and stability of correlated equilibria of linear congestion games,,
ESA'05 Proceedings of the 13th annual European conference on Algorithms
The complexity of games on highly regular graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Symmetry in network congestion games: pure equilibria and anarchy cost
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Atomic selfish routing in networks: a survey
WINE'05 Proceedings of the First international conference on Internet and Network Economics
New results on the complexity of uniformly mixed nash equilibria
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Nash equilibria in all-optical networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Tight bounds for selfish and greedy load balancing
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The game world is flat: the complexity of nash equilibria in succinct games
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Atomic congestion games among coalitions
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Multicast transmissions in non-cooperative networks with a limited number of selfish moves
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Pure nash equilibria in games with a large number of actions
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On nash equilibria in non-cooperative all-optical networks
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
The max k-cut game and its strong equilibria
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
On nash equilibria for multicast transmissions in ad-hoc wireless networks
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On the complexity of uniformly mixed nash equilibria and related regular subgraph problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Tα Παιδíα Παíζϵι the interaction between algorithms and game theory
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Efficient convergence to pure nash equilibria in weighted network congestion games
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
On the power of nodes of degree four in the local max-cut problem
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Nash equilibria with minimum potential in undirected broadcast games
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
On allocations with negative externalities
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Optimal pricing in social networks with incomplete information
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
The complexity of approximate nash equilibrium in congestion games with negative delays
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Intrinsic robustness of the price of anarchy
Communications of the ACM
Convergence and approximation in potential games
Theoretical Computer Science
Proceedings of the 13th ACM Conference on Electronic Commerce
The price of anarchy in games of incomplete information
Proceedings of the 13th ACM Conference on Electronic Commerce
The speed of convergence in congestion games under best-response dynamics
ACM Transactions on Algorithms (TALG)
Dynamics of profit-sharing games
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Survey: A glimpse at Christos H. Papadimitriou
Computer Science Review
Survey: Equilibria, fixed points, and complexity classes
Computer Science Review
Selfish splittable flows and NP-completeness
Computer Science Review
Enforcing efficient equilibria in network design games via subsidies
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Computing approximate pure Nash equilibria in congestion games
ACM SIGecom Exchanges
On the existence of nash equilibria in strategic search games
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
The new faces of combinatorial optimization
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
On the impact of fair best response dynamics
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On the complexity of game isomorphism
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Congestion games with player-specific constants
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Probabilistic techniques in algorithmic game theory
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
A first step towards analyzing the convergence time in player-specific singleton congestion games
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Capacitated network design games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Decentralized dynamics for finite opinion games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Congestion games with capacitated resources
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Minimizing expectation plus variance
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
A theoretical examination of practical game playing: lookahead search
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
On the PLS-complexity of maximum constraint assignment
Theoretical Computer Science
Atomic congestion games on graphs and their applications in networking
IEEE/ACM Transactions on Networking (TON)
Convergence of best-response dynamics in games with conflicting congestion effects
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
A method based on congestion game theory for determining electoral tendencies
SocInfo'12 Proceedings of the 4th international conference on Social Informatics
NP-hardness of pure Nash equilibrium in Scheduling and Network Design Games
Theoretical Computer Science
Learning equilibria of games via payoff queries
Proceedings of the fourteenth ACM conference on Electronic commerce
Altruism in Atomic Congestion Games
ACM Transactions on Economics and Computation
Computational Aspects of Uncertainty Profiles and Angel-Daemon Games
Theory of Computing Systems
| Hi-index | 0.04 |
We investigate from the computational viewpoint multi-player games that are guaranteed to have pure Nash equilibria. We focus on congestion games, and show that a pure Nash equilibrium can be computed in polynomial time in the symmetric network case, while the problem is PLS-complete in general. We discuss implications to non-atomic congestion games, and we explore the scope of the potential function method for proving existence of pure Nash equilibria.