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
- On the performance of approximate equilibria in congestion games
- Designing fast converging cost sharing methods for multicast transmissions
- Symmetries and the complexity of pure Nash equilibrium
- On spectrum sharing games
- scientific article; zbMATH DE number 6783488 (Why is no real title available?)
- The complexity of pure equilibria in mix-weighted congestion games on parallel links
- The Complexity of Nash Equilibria in Limit-Average Games
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games
- Nash equilibria with minimum potential in undirected broadcast games
- Convergence and approximation in potential games
- Atomic congestion games: fast, myopic and concurrent
- The maximal generic number of pure Nash equilibria
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Computing approximate Nash equilibria in network congestion games
- The price of atomic selfish ring routing
- Symmetries and the Complexity of Pure Nash Equilibrium
- Strong equilibria in games with the lexicographical improvement property
- Concurrent imitation dynamics in congestion games
- Coordination mechanisms
- The complexity of computing a Nash equilibrium
- On oblivious PTAS's for nash equilibrium
- Computing Approximate Nash Equilibria in Network Congestion Games
- Dynamics of Profit-Sharing Games
- Pairwise-interaction games
- Network topology and equilibrium existence in weighted network congestion games
- $\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
- On influence, stable behavior, and the most influential individuals in networks: a game-theoretic approach
- Approximate Nash equilibria in anonymous games
- On the performance of mildly greedy players in cut games
- On the complexity of Pareto-optimal Nash and strong equilibria
- On the impact of combinatorial structure on congestion games
- Weighted Boolean formula games
- Selfish routing with incomplete information
- Strategic multiway cut and multicut games
- Rational generating functions and integer programming games
- On the complexity of Pareto-optimal Nash and strong equilibria
- Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
- Dynamics in network interaction games
- On the Complexity of Nash Equilibria and Other Fixed Points
- Congestion games with linearly independent paths: convergence time and price of anarchy
- Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
- Selfish unsplittable flows
- Nash equilibria: complexity, symmetries, and approximation
- Performance of one-round walks in linear congestion games
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)
