The complexity of pure Nash equilibria
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Symmetries and the complexity of pure Nash equilibrium
- Pure Nash equilibria in player-specific and weighted congestion games
- How hard is it to find extreme Nash equilibria in network congestion games?
- Weighted congestion games with separable preferences
- Nash equilibria in all-optical networks
- The maximal generic number of pure Nash equilibria
- Undecidability of the existence of pure Nash equilibria
- An abstraction-refinement methodology for reasoning about network games
- Computing pure Nash equilibria in network revenue management games
- A logarithmic approximation for polymatroid congestion games
- Incentive-based search for efficient equilibria of the public goods game
- Computing solutions of the multiclass network equilibrium problem with affine cost functions
- Metastability of logit dynamics for coordination games
- Dynamics in network interaction games
- Strategic multiway cut and multicut games
- Designing fast converging cost sharing methods for multicast transmissions
- Precise complexity of the core in dichotomous and additive hedonic games
- Computational aspects of the colorful Carathéodory theorem
- Optimization of multi-criteria facility-based systems via vector potential approach
- The complexity of the parity argument with potential
- Computing equilibrium in network utility-sharing and discrete election games
- Commonsense explanations of sparsity, Zipf law, and Nash's bargaining solution
- Combinatorial auctions with endowment effect
- Timed network games
- Equilibrium computation in resource allocation games
- Convergence of incentive-driven dynamics in Fisher markets
- Timing matters: online dynamics in broadcast games
- Unique end of potential line
- The power of one evil secret agent
- Computation and efficiency of potential function minimizers of combinatorial congestion games
- Chance-constrained games with mixture distributions
- Approximate Nash equilibria in anonymous games
- Leadership in singleton congestion games: what is hard and what is easy
- Self-organizing flows in social networks
- Enforcing efficient equilibria in network design games via subsidies
- Efficient coordination mechanisms for unrelated machine scheduling
- Strong equilibria in games with the lexicographical improvement property
- On spectrum sharing games
- On the convergence of multicast games in directed networks
- Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
- Computational aspects of uncertainty profiles and angel-daemon games
- Greediness and equilibrium in congestion games
- Stability vs. optimality in selfish ring routing
- Selfish routing with incomplete information
- On influence, stable behavior, and the most influential individuals in networks: a game-theoretic approach
- Selfish unsplittable flows
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
- Pure Nash equilibria in a generalization of congestion games allowing resource failures
- Complexity and optimality of the best response algorithm in random potential games
- Computing all solutions of Nash equilibrium problems with discrete strategy sets
- Convergence method, properties and computational complexity for Lyapunov games
- Self-organizing flows in social networks
- Concurrent imitation dynamics in congestion games
- The complexity of welfare maximization in congestion games
- Rational generating functions and integer programming games
- Computing approximate Nash equilibria in network congestion games
- The complexity of computing a Nash equilibrium
- Metastability of asymptotically well-behaved potential games
- Sharing non-anonymous costs of multiple resources optimally
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- Many-one reductions and the category of multivalued functions
- Pairwise-interaction games
- Settling the complexity of local max-cut (almost) completely
- Computation of equilibria and the price of anarchy in bottleneck congestion games
- On the Complexity of Nash Equilibria and Other Fixed Points
- scientific article; zbMATH DE number 5942357 (Why is no real title available?)
- The Complexity of Nash Equilibria in Limit-Average Games
- Decentralized dynamics for finite opinion games
- On the complexity of Pareto-optimal Nash and strong equilibria
- On the complexity of pure-strategy Nash equilibria in congestion and local-effect games
- Integer Programming: Optimization and Evaluation Are Equivalent
- The power of one secret agent
- Generalized mirror descents in congestion games
- Network-formation games with regular objectives
- On the uniqueness of equilibrium in atomic splittable routing games
- On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
- On the impact of combinatorial structure on congestion games
- Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions
- Weighted Boolean formula games
- A selective tour through congestion games
- On the performance of mildly greedy players in cut games
- Computing Approximate Nash Equilibria in Network Congestion Games
- Complexity of pure Nash equilibria in player-specific network congestion games
- Symmetries and the Complexity of Pure Nash Equilibrium
- $\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
- Malicious Bayesian Congestion Games
- Probabilistic Techniques in Algorithmic Game Theory
- The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
- Management of Variable Data Streams in Networks
- Asynchronous congestion games
- On the complexity of Pareto-optimal Nash and strong equilibria
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Nash equilibria with minimum potential in undirected broadcast games
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games
- Convergence and approximation in potential games
- Equilibria, fixed points, and complexity classes
- Nash equilibria: complexity, symmetries, and approximation
- Selfish splittable flows and NP-completeness
- Convergence of best-response dynamics in games with conflicting congestion effects
- Resource buying 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)
