Strong equilibrium in cost sharing connection games
From MaRDI portal
Publication:834855
DOI10.1016/J.GEB.2008.07.002zbMATH Open1168.91330OpenAlexW2013391976MaRDI QIDQ834855FDOQ834855
Authors: Amir Epstein, Michal Feldman, Yishay Mansour 
Publication date: 27 August 2009
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.7895
Recommendations
Cites Work
- Serial Cost Sharing
- Worst-case equilibria
- Coalition-proof Nash equilibria. I: Concepts
- A class of games possessing pure-strategy Nash equilibria
- How bad is selfish routing?
- Potential games
- The Price of Stability for Network Design with Fair Cost Allocation
- Strong Price of Anarchy for Machine Load Balancing
- Title not available (Why is that?)
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- The price of anarchy of finite congestion games
- Atomic Congestion Games Among Coalitions
- Social optimality and cooperation in nonatomic congestion games.
- Efficient graph topologies in network routing games
- Network structure and strong equilibrium in route selection games.
- Algorithms, games, and the internet
- Network topology and the efficiency of equilibrium
- On a network creation game
- On nash equilibria for a network creation game
- Network formation games with local coalitions
- The effect of collusion in congestion games
- Topological Conditions for Uniqueness of Equilibrium in Networks
- The price of routing unsplittable flow
- Strong equilibrium in congestion games
- Title not available (Why is that?)
- Automata, Languages and Programming
- Approximation and Online Algorithms
- The price of anarchy is independent of the network topology
- Near-optimal network design with selfish agents
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equilibrium and potential in coalitional congestion games
Cited In (41)
- The price of anarchy on uniformly related machines revisited
- Strategic network formation through an intermediary
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing
- A game-theoretical model of the landscape theory
- Approximate strong equilibria in job scheduling games with two uniformly related machines
- Balancing Load via Small Coalitions in Selfish Ring Routing Games
- Mechanism and Network Design with Private Negative Externalities
- The price of stability for undirected broadcast network design with fair cost allocation is constant
- Strong price of anarchy
- On the Price of Stability of Undirected Multicast Games
- Optimal cost sharing for capacitated facility location games
- Cost-Sharing Scheduling Games on Restricted Unrelated Machines
- Cost-sharing scheduling games on restricted unrelated machines
- Competitive cost sharing with economies of scale
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
- Strong equilibrium in network congestion games: increasing versus decreasing costs
- Preference revelation games and strict cores of multiple‐type housing market problems
- Efficient graph topologies in network routing games
- Congestion games with linearly independent paths: convergence time and price of anarchy
- Inefficiency of equilibria for scheduling game with machine activation costs
- Non-cooperative facility location and covering games
- Cost-sharing games in real-time scheduling systems
- Convergence of best-response dynamics in games with conflicting congestion effects
- Capacitated network design games
- Resource buying games
- Approximate Strong Equilibrium in Job Scheduling Games
- Price of stability in survivable network design
- Computing the strong Nash equilibrium for Markov chains games
- Exact and approximate equilibria for optimal group network formation
- Variational inequalities, Ky Fan minimax inequality; and strong Nash equilibria in generalized games
- Strong Nash equilibrium in games with common and complementary local utilities
- Pricing traffic in a spanning network
- Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness
- Efficiency analysis of load balancing games with and without activation costs
- Implementing efficient graphs in connection networks
- Arbitrary profit sharing in federated learning utility games
- Strategic cooperation in cost sharing games
- Strategic multiway cut and multicut games
This page was built for publication: Strong equilibrium in cost sharing connection games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834855)
