The complexity of pure Nash equilibria
From MaRDI portal
Publication:3580952
Recommendations
Cited in
(only showing first 100 items - show all)- Computing all solutions of Nash equilibrium problems with discrete strategy sets
- Selfish versus unselfish optimization of network creation
- On the convergence of multicast games in directed networks
- Generalized mirror descents in congestion games
- Network-formation games with regular objectives
- Computing Approximate Nash Equilibria in Network Congestion Games
- Simultaneous contests with equal sharing allocation of prizes: computational complexity and price of anarchy
- Convergence of best-response dynamics in games with conflicting congestion effects
- The existence of a pure-strategy Nash equilibrium in a discrete ponds dilemma
- Alternating minima and maxima, Nash equilibria and bounded arithmetic
- Capacitated network design games
- Pure Nash equilibria in a generalization of congestion games allowing resource failures
- Project games
- Automata, Languages and Programming
- Resource buying games
- Selfish unsplittable flows
- Designing fast converging cost sharing methods for multicast transmissions
- On the performance of mildly greedy players in cut games
- A selective tour through congestion games
- $\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
- Pure Nash equilibria in a generalization of congestion games allowing resource failures
- The Price of Stochastic Anarchy
- Convergence and approximation in potential games
- Nash equilibria in all-optical networks
- Congestion games with complementarities
- Coordination games on weighted directed graphs
- Atomic Congestion Games: Fast, Myopic and Concurrent
- Computational aspects of the colorful Carathéodory theorem
- Characterizing the existence of potential functions in weighted congestion games
- The complexity of pure equilibria in mix-weighted congestion games on parallel links
- Performance of one-round walks in linear congestion games
- Competitive routing over time
- Pairwise-interaction games
- Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
- On the Complexity of Nash Equilibria and Other Fixed Points
- Dynamics of Profit-Sharing Games
- Metastability of asymptotically well-behaved potential games
- Existence and verification of Nash equilibria in non-cooperative contribution games with resource contention
- Computing better approximate pure Nash equilibria in cut games via semidefinite programming
- Incentive-based search for efficient equilibria of the public goods game
- Integer Programming: Optimization and Evaluation Are Equivalent
- Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game
- Equilibria problems on games: complexity versus succinctness
- On the complexity of Pareto-optimal Nash and strong equilibria
- The price of stability of weighted congestion games
- The price of stability of weighted congestion games
- On the complexity of Pareto-optimal Nash and strong equilibria
- Timing matters: online dynamics in broadcast games
- Uniform mixed equilibria in network congestion games with link failures
- Greediness and equilibrium in congestion games
- Stability vs. optimality in selfish ring routing
- Mathematical Foundations of Computer Science 2005
- On the uniqueness of equilibrium in atomic splittable routing games
- Strong equilibria in games with the lexicographical improvement property
- On the impact of player capability on congestion games
- Computing equilibrium in network utility-sharing and discrete election games
- Symmetries and the Complexity of Pure Nash Equilibrium
- Network movement games
- Stochastic convergence to recurrent state equilibrium for state-based games
- The complexity of optimizing atomic congestion
- The power of one evil secret agent
- Approximate Nash equilibria in anonymous games
- Computing equilibria: a computational complexity perspective
- Chance-constrained games with mixture distributions
- Network topology and equilibrium existence in weighted network congestion games
- Equilibria in Multiclass and Multidimensional Atomic Congestion Games
- Commonsense explanations of sparsity, Zipf law, and Nash's bargaining solution
- Sharing non-anonymous costs of multiple resources optimally
- Computing the price of anarchy in atomic network congestion games (invited talk)
- Precise complexity of the core in dichotomous and additive hedonic games
- Dynamics in network interaction games
- A logarithmic approximation for polymatroid congestion games
- Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games
- Stackelberg pricing games with congestion effects
- On the impact of combinatorial structure on congestion games
- Computing approximate equilibria in weighted congestion games via best-responses
- Convergence method, properties and computational complexity for Lyapunov games
- Strategic multiway cut and multicut games
- Probabilistic Techniques in Algorithmic Game Theory
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games
- Nash equilibria with minimum potential in undirected broadcast games
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
- The power of one secret agent
- Some results of Maria Serna on strategic games: complexity of equilibria and models
- The classes PPA-\(k\): existence from arguments modulo \(k\)
- Malicious Bayesian Congestion Games
- On influence, stable behavior, and the most influential individuals in networks: a game-theoretic approach
- scientific article; zbMATH DE number 5942357 (Why is no real title available?)
- Fighting for routes: resource allocation among competing planners in transportation networks
- Nash equilibria in two-resource congestion games with player-specific payoff functions
- scientific article; zbMATH DE number 7378728 (Why is no real title available?)
- Computing equilibria of Cournot oligopoly models with mixed-integer quantities
- Synthesis from component libraries with costs
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- Combinatorial auctions with endowment effect
- On the Complexity of Equilibrium Computation in First-Price Auctions
- The structure and complexity of Nash equilibria for a selfish routing game
- Timed network games with clocks
- On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
- Coordination mechanisms
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)
