Strong equilibrium in congestion games
From MaRDI portal
Recommendations
- Strong equilibrium in network congestion games: increasing versus decreasing costs
- Strong and Pareto Price of Anarchy in Congestion Games
- Strong Nash equilibrium in games with common and complementary local utilities
- Equilibria in bottleneck games
- Congestion games with player-specific payoff functions
Cites work
- A bound on the number of Nash equilibria in a coordination game.
- A class of games possessing pure-strategy Nash equilibria
- Congestion games with player-specific payoff functions
- Equilibria in a model with partial rivalry
- scientific article; zbMATH DE number 3139273 (Why is no real title available?)
- Potential games
Cited in
(79)- Strong price of anarchy
- Efficient graph topologies in network routing games
- Strategic basins of attraction, the path dominance core, and network formation games
- Network structure and strong equilibrium in route selection games.
- Computing the strong Nash equilibrium for Markov chains games
- Coordination games on graphs
- The intermediate price of anarchy (IPoA) in bin packing games
- Congestion games viewed from M-convexity
- Designing fast converging cost sharing methods for multicast transmissions
- Selfish vector packing
- A game-theoretical model of the landscape theory
- Negotiating team formation using deep reinforcement learning
- Internalization of social cost in congestion games
- On weak Pareto optimality of nonatomic routing networks
- Cooperative congestion games: existence of a Nash-stable coalition structure
- Timing matters: online dynamics in broadcast games
- Quality of equilibria for selfish bin packing with cost sharing variants
- Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness
- Dynamic resource allocation games
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- A survey of static and dynamic potential games
- Strong equilibria in games with the lexicographical improvement property
- On the convergence of multicast games in directed networks
- Congestion games revisited
- Scheduling selfish jobs on multidimensional parallel machines
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing
- Approximate strong equilibria in job scheduling games with two uniformly related machines
- Greediness and equilibrium in congestion games
- Games of competition in a stochastic environment
- On singleton congestion games with resilience against collusion
- Congestion games with variable demands
- Network topologies for weakly Pareto optimal nonatomic selfish routing
- Dynamic resource allocation games
- Partition Equilibrium Always Exists in Resource Selection Games
- On the complexity of Pareto-optimal Nash and strong equilibria
- Selfish vector packing
- Selfish Bin Packing
- Strong and Pareto Price of Anarchy in Congestion Games
- On the complexity of Pareto-optimal Nash and strong equilibria
- Partition equilibrium always exists in resource selection games
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Selfish bin packing with cardinality constraints
- Selfish bin coloring
- The price of anarchy on uniformly related machines revisited
- Repeated congestion games with bounded rationality
- A bin packing game with cardinality constraints under the best cost rule
- CONGESTION GAMES AND POTENTIALS RECONSIDERED
- Network topology and equilibrium existence in weighted network congestion games
- Strong equilibrium in network congestion games: increasing versus decreasing costs
- Coordination games on directed graphs
- Strong Nash equilibrium in games with common and complementary local utilities
- Atomic dynamic flow games: adaptive vs. nonadaptive agents
- On existence of equilibrium under social coalition structures
- Profit sharing with thresholds and non-monotone player utilities
- Coordination games on weighted directed graphs
- Acyclicity of improvements in finite game forms
- Selfish bin packing
- Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
- The Price of Anarchy on Uniformly Related Machines Revisited
- Approximate Strong Equilibrium in Job Scheduling Games
- Equilibria in bottleneck games
- Preference revelation games and strict cores of multiple‐type housing market problems
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- Price of stability in survivable network design
- Candidate coalitions and strategic manipulation in multi-winner elections: an evaluation of committee scoring rules
- A game-theoretic framework for distributed load balancing: static and dynamic game models
- The price of anarchy in the congestion game with flow constraints
- Necessary and sufficient conditions for the existence of fuzzy doubly strong equilibria in generalized fuzzy games
- Fear of exclusion: the dynamics of club formation
- Best response dynamics in finite games with additive aggregation
- Exact and approximate equilibria for optimal group network formation
- Competitive routing over time
- An algorithmic analysis of parallel contests
- Strong mediated equilibrium
- Strong equilibrium in cost sharing connection games
- Network topology and the efficiency of equilibrium
- Capacitated network design games
- Dynamic club formation with coordination
- Congestion games with linearly independent paths: convergence time and price of anarchy
This page was built for publication: Strong equilibrium in congestion games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1378018)
