The complexity of pure Nash equilibria
From MaRDI portal
Publication:3580952
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- Complexity of pure Nash equilibria in player-specific network congestion games
- Weighted congestion games with separable preferences
- Computation of equilibria and the price of anarchy in bottleneck congestion games
- Convergence to approximate Nash equilibria in congestion games
- Efficient coordination mechanisms for unrelated machine scheduling
- How hard is it to find extreme Nash equilibria in network congestion games?
- Selfish splittable flows and NP-completeness
- scientific article; zbMATH DE number 2243403 (Why is no real title available?)
- Congestion games with capacitated resources
- Computing Nash equilibria for two-player restricted network congestion games is \(\mathcal{PLS}\)-complete
- Decentralized dynamics for finite opinion games
- On the complexity of pure-strategy Nash equilibria in congestion and local-effect games
- Tight bounds for selfish and greedy load balancing
- Minimizing expectation plus variance
- Pure Nash equilibria in player-specific and weighted congestion games
- Greediness and equilibrium in congestion games
- Stability vs. optimality in selfish ring routing
- Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game
- Metastability of asymptotically well-behaved potential games
- Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
- Resource buying games
- Generalized mirror descents in congestion games
- The complexity of welfare maximization in congestion games
- On best response dynamics in weighted congestion games with polynomial delays
- Graphical congestion games
- Network movement games
- Network-formation games with regular objectives
- The structure and complexity of Nash equilibria for a selfish routing game
- On the uniqueness of equilibrium in atomic splittable routing games
- Convergence of best-response dynamics in games with conflicting congestion effects
- Equilibria, fixed points, and complexity classes
- The complexity of uniform Nash equilibria and related regular subgraph problems
- 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
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)
