The complexity of pure Nash equilibria
From MaRDI portal
Publication:3580952
Recommendations
Cited in
(only showing first 100 items - show all)- The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
- Complexity and optimality of the best response algorithm in random potential games
- Timed network games
- Characterizing the existence of potential functions in weighted congestion games
- A metaheuristic approach to compute pure Nash equilibria
- Computing solutions of the multiclass network equilibrium problem with affine cost functions
- The Price of Stochastic Anarchy
- Sharing non-anonymous costs of multiple resources optimally
- Automata, Languages and Programming
- Convergence method, properties and computational complexity for Lyapunov games
- Nash equilibria in all-optical networks
- An abstraction-refinement methodology for reasoning about network games
- Alternating minima and maxima, Nash equilibria and bounded arithmetic
- On the Complexity of Equilibrium Computation in First-Price Auctions
- Convergence of incentive-driven dynamics in Fisher markets
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- Incentive-based search for efficient equilibria of the public goods game
- Capacitated network design games
- Some results of Maria Serna on strategic games: complexity of equilibria and models
- Management of Variable Data Streams in Networks
- Pure-strategy equilibrium in Bayesian potential games with absolutely continuous information
- A selective tour through congestion games
- On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
- The inefficiency of Nash and subgame perfect equilibria for network routing
- Computing pure Nash equilibria in network revenue management games
- Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games
- Precise complexity of the core in dichotomous and additive hedonic games
- Undecidability of the existence of pure Nash equilibria
- Computing equilibria of Cournot oligopoly models with mixed-integer quantities
- scientific article; zbMATH DE number 5942357 (Why is no real title available?)
- Synthesis from component libraries with costs
- Selfish versus unselfish optimization of network creation
- Mathematical Foundations of Computer Science 2005
- On the impact of singleton strategies in congestion games
- Computing all solutions of Nash equilibrium problems with discrete strategy sets
- Equilibria in Multiclass and Multidimensional Atomic Congestion Games
- Congestion games with complementarities
- Competitive routing over time
- Computational aspects of the colorful Carathéodory theorem
- How to find Nash equilibria with extreme total latency in network congestion games?
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
- A logarithmic approximation for polymatroid congestion games
- The impact of social ignorance on weighted congestion games
- Computing approximate equilibria in weighted congestion games via best-responses
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- Atomic Congestion Games: Fast, Myopic and Concurrent
- Coordination games on weighted directed graphs
- Fast convergence of best-reply dynamics in aggregative games
- The price of stability of weighted congestion games
- The price of stability of weighted congestion games
- Complexity of pure-strategy Nash equilibria in non-cooperative games
- Metastability of logit dynamics for coordination games
- Equilibria problems on games: complexity versus succinctness
- Computational aspects of uncertainty profiles and angel-daemon games
- On the complexity of constrained Nash equilibria in graphical games
- Computing equilibria: a computational complexity perspective
- Malicious Bayesian Congestion Games
- Unique End of Potential Line
- Pure Nash equilibria in a generalization of congestion games allowing resource failures
- On the convergence of multicast games in directed networks
- Computation and efficiency of potential function minimizers of combinatorial congestion games
- Many-one reductions and the category of multivalued functions
- Timed network games with clocks
- Fighting for routes: resource allocation among competing planners in transportation networks
- Nash equilibria in two-resource congestion games with player-specific payoff functions
- Equilibrium computation in resource allocation games
- Leadership in singleton congestion games: what is hard and what is easy
- Asynchronous congestion games
- Integer Programming: Optimization and Evaluation Are Equivalent
- The complexity of the parity argument with potential
- Existence and verification of Nash equilibria in non-cooperative contribution games with resource contention
- Commonsense explanations of sparsity, Zipf law, and Nash's bargaining solution
- Computing better approximate pure Nash equilibria in cut games via semidefinite programming
- Uniform mixed equilibria in network congestion games with link failures
- The power of one evil secret agent
- Enforcing efficient equilibria in network design games via subsidies
- Self-organizing flows in social networks
- Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions
- Optimization of multi-criteria facility-based systems via vector potential approach
- Probabilistic Techniques in Algorithmic Game Theory
- Computing equilibrium in network utility-sharing and discrete election games
- scientific article; zbMATH DE number 7378728 (Why is no real title available?)
- The classes PPA-\(k\): existence from arguments modulo \(k\)
- Timed network games
- Simultaneous contests with equal sharing allocation of prizes: computational complexity and price of anarchy
- Combinatorial auctions with endowment effect
- Self-organizing flows in social networks
- Computing the price of anarchy in atomic network congestion games (invited talk)
- Unique end of potential line
- The classes PPA-\(k\): existence from arguments modulo \(k\)
- On the impact of player capability on congestion games
- Timing matters: online dynamics in broadcast games
- The power of one secret agent
- Settling the complexity of local max-cut (almost) completely
- Chance-constrained games with mixture distributions
- The complexity of gradient descent: CLS = PPAD \(\cap\) pls
- The existence of a pure-strategy Nash equilibrium in a discrete ponds dilemma
- Stackelberg pricing games with congestion effects
- Stochastic convergence to recurrent state equilibrium for state-based games
- Pure Nash equilibria in a generalization of congestion games allowing resource failures
This page was built for publication: The complexity of pure Nash equilibria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580952)
