The complexity of pure Nash equilibria
From MaRDI portal
Publication:3580952
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- Computing solutions of the multiclass network equilibrium problem with affine cost functions
- How to find Nash equilibria with extreme total latency in network congestion games?
- The impact of social ignorance on weighted congestion games
- Timed network games
- The complexity of gradient descent: CLS = PPAD \(\cap\) pls
- On the complexity of constrained Nash equilibria in graphical games
- Self-organizing flows in social networks
- On the complexity of pure-strategy Nash equilibria in congestion and local-effect games
- scientific article; zbMATH DE number 2243403 (Why is no real title available?)
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- On the impact of singleton strategies in congestion games
- Nash equilibria: complexity, symmetries, and approximation
- Complexity of pure Nash equilibria in player-specific network congestion games
- The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
- Weighted Boolean formula games
- The inefficiency of Nash and subgame perfect equilibria for network routing
- Computation and efficiency of potential function minimizers of combinatorial congestion games
- On spectrum sharing games
- How hard is it to find extreme Nash equilibria in network congestion games?
- Enforcing efficient equilibria in network design games via subsidies
- Self-organizing flows in social networks
- The complexity of computing a Nash equilibrium
- Concurrent imitation dynamics in congestion games
- Settling the complexity of local max-cut (almost) completely
- The maximal generic number of pure Nash equilibria
- An abstraction-refinement methodology for reasoning about network games
- Undecidability of the existence of pure Nash equilibria
- The Complexity of Nash Equilibria in Limit-Average Games
- Graphical congestion games
- Efficient coordination mechanisms for unrelated machine scheduling
- The complexity of uniform Nash equilibria and related regular subgraph problems
- Symmetries and the complexity of pure Nash equilibrium
- Metastability of logit dynamics for coordination games
- The complexity of welfare maximization in congestion games
- Leadership in singleton congestion games: what is hard and what is easy
- Complexity of pure-strategy Nash equilibria in non-cooperative games
- The classes PPA-\(k\): existence from arguments modulo \(k\)
- Computing Nash equilibria for two-player restricted network congestion games is \(\mathcal{PLS}\)-complete
- Convergence to approximate Nash equilibria in congestion games
- Tight bounds for selfish and greedy load balancing
- Minimizing expectation plus variance
- On best response dynamics in weighted congestion games with polynomial delays
- Pure-strategy equilibrium in Bayesian potential games with absolutely continuous information
- Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
- Computation of equilibria and the price of anarchy in bottleneck congestion games
- Selfish splittable flows and NP-completeness
- Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Computational aspects of uncertainty profiles and angel-daemon games
- Equilibrium computation in resource allocation games
- Optimization of multi-criteria facility-based systems via vector potential approach
- Timed network games
- Rational generating functions and integer programming games
- Atomic congestion games: fast, myopic and concurrent
- Decentralized dynamics for finite opinion games
- Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
- Asynchronous congestion games
- Selfish routing with incomplete information
- Unique End of Potential Line
- scientific article; zbMATH DE number 6783488 (Why is no real title available?)
- On the performance of approximate equilibria in congestion games
- On oblivious PTAS's for nash equilibrium
- The complexity of the parity argument with potential
- Many-one reductions and the category of multivalued functions
- Computing pure Nash equilibria in network revenue management games
- Computing approximate Nash equilibria in network congestion games
- Fast convergence of best-reply dynamics in aggregative games
- Congestion games with capacitated resources
- Pure Nash equilibria in player-specific and weighted congestion games
- Equilibria, fixed points, and complexity classes
- A metaheuristic approach to compute pure Nash equilibria
- The price of atomic selfish ring routing
- Convergence of incentive-driven dynamics in Fisher markets
- Unique end of potential line
- Complexity and optimality of the best response algorithm in random potential games
- Congestion games with linearly independent paths: convergence time and price of anarchy
- Weighted congestion games with separable preferences
- Management of Variable Data Streams in Networks
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)
