A class of games possessing pure-strategy Nash equilibria
From MaRDI portal
Publication:2560099
Cites work
Cited in
(only showing first 100 items - show all)- Symmetries and the complexity of pure Nash equilibrium
- Strong price of anarchy
- Distributed consensus in noncooperative inventory games
- Pure Nash equilibria in player-specific and weighted congestion games
- Efficient graph topologies in network routing games
- Strategic basins of attraction, the path dominance core, and network formation games
- How hard is it to find extreme Nash equilibria in network congestion games?
- Weighted congestion games with separable preferences
- Two-terminal routing games with unknown active players
- Pure strategy equilibria in a class of systems defense games
- Equilibrium in a finite local public goods economy
- Potentials in cooperative TU-games
- Correlated equilibrium and potential games
- Strong equilibrium in congestion games
- Pure strategy Nash equilibrium in a group formation game with positive externalities
- Equilibria and approximate equilibria in infinite potential games
- How noise matters.
- Network structure and strong equilibrium in route selection games.
- Regret-based continuous-time dynamics.
- Social optimality and cooperation in nonatomic congestion games.
- A Shapley value representation of potential games
- Tight inefficiency bounds for perception-parameterized affine congestion games
- An abstraction-refinement methodology for reasoning about network games
- Uniqueness of equilibria in atomic splittable polymatroid congestion games
- Congestion games with mixed objectives
- Self-fulfilling signal of an endogenous state in network congestion games
- Potential differential games
- A universal construction generating potential games
- Vector games with potential function
- Coordination games on graphs
- Weakly-acyclic (internet) routing games
- Efficiency in a forced contribution threshold public good game
- Incomplete-profile potential games
- A logarithmic approximation for polymatroid congestion games
- Incentive-based search for efficient equilibria of the public goods game
- From Boolean game to potential game
- Stochastic learning in multi-agent optimization: communication and payoff-based approaches
- On the equivalence of robustness to canonical and general elaborations
- Computing solutions of the multiclass network equilibrium problem with affine cost functions
- Non-atomic one-round walks in congestion games
- The problem of multiple commons: a market design approach
- Improved bounds on equilibria solutions in the network design game
- Opinion formation games with dynamic social influences
- Congestion games viewed from M-convexity
- Competitive location, production, and market selection
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Minimality of consistent solutions for strategic games, in particular for potential games
- Axiomatic characterizations of solutions for Bayesian games
- Designing fast converging cost sharing methods for multicast transmissions
- Potential maximizers and network formation
- On the existence of a pure strategy Nash equilibrium in group formation games
- A game-theoretical model of the landscape theory
- Congestion control for a system with parallel stations and homogeneous customers using priority passes
- Strategies and evolution in the minority game: a multi-round strategy experiment
- Equilibrium strategies for multiple interdictors on a common network
- A review of transport market modeling using game-theoretic principles
- Optimization of multi-criteria facility-based systems via vector potential approach
- Non-cooperative queueing games on a network of single server queues
- Traffic congestion pricing via network congestion game approach
- Internalization of social cost in congestion games
- Urgency-aware optimal routing in repeated games through artificial currencies
- Origin-to-destination network flow with path preferences and velocity controls: a mean field game-like approach
- A comprehensive survey on STP approach to finite games
- Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game
- On the robustness of the approximate price of anarchy in generalized congestion games
- Social learning in nonatomic routing games
- Delegation and ambiguity in correlated equilibrium
- Chaotic triopoly game: a congestion case
- Computing equilibrium in network utility-sharing and discrete election games
- Atomic congestion games with random players: network equilibrium and the price of anarchy
- Load balancing congestion games and their asymptotic behavior
- Cooperative congestion games: existence of a Nash-stable coalition structure
- A survey on decomposition of finite strategic-form games
- Large deviations and stochastic stability in population games
- Timed network games
- Matrix approach to verification of finite multi-potential games
- Robust perfect equilibrium in large games
- Weighted and near weighted potential games with application to game theoretic control
- Equilibrium computation in resource allocation games
- On congestion games with player-specific costs and resource failures
- Beyond Pigouvian taxes: a worst case analysis
- Best-response dynamics in combinatorial auctions with item bidding
- Primary versus secondary infrastructure capacity allocation mechanisms
- Sensitivity of wardrop equilibria: revisited
- Allocating costs in set covering problems
- Multi-round cooperative search games with multiple players
- Timing matters: online dynamics in broadcast games
- The power of one evil secret agent
- The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler
- The price of stability for undirected broadcast network design with fair cost allocation is constant
- Ordinal potentials in smooth games
- With potential games, which outcome is better?
- On approximate pure Nash equilibria in weighted congestion games with polynomial latencies
- The minimum tollbooth problem in atomic network congestion games with unsplittable flows
- Computation and efficiency of potential function minimizers of combinatorial congestion games
- Committing to correlated strategies with multiple leaders
- Games and cost of change
- Nash-stable coalition partition and potential functions in games with coalition structure
- Approximate Nash equilibria in anonymous games
- Local smoothness and the price of anarchy in splittable congestion games
This page was built for publication: A class of games possessing pure-strategy Nash equilibria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2560099)
