Strong price of anarchy
From MaRDI portal
Publication:1007765
DOI10.1016/j.geb.2008.03.005zbMath1156.91419OpenAlexW1972926214WikidataQ92407013 ScholiaQ92407013MaRDI QIDQ1007765
Michal Feldman, Nir Andelman, Yishay Mansour
Publication date: 24 March 2009
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2008.03.005
coalitionsnetwork formationcongestion gamesjob schedulingprice of anarchystrong equilibriumstrong price of anarchy
Related Items (55)
On the Complexity of Pareto-optimal Nash and Strong Equilibria ⋮ Cost-Sharing Scheduling Games on Restricted Unrelated Machines ⋮ Strong equilibria in games with the lexicographical improvement property ⋮ Cost-sharing scheduling games on restricted unrelated machines ⋮ Selfish Vector Packing ⋮ Scheduling selfish jobs on multidimensional parallel machines ⋮ On the complexity of Pareto-optimal Nash and strong equilibria ⋮ Computing pure Nash and strong equilibria in bottleneck congestion games ⋮ On the Tree Conjecture for the Network Creation Game ⋮ The quality of equilibria for set packing and throughput scheduling games ⋮ Implementing efficient graphs in connection networks ⋮ Coordination games on graphs ⋮ Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy ⋮ Multitask \(n\)-vehicle exploration problem: complexity and algorithm ⋮ Social distancing network creation ⋮ On tree equilibria in max-distance network creation games ⋮ Selfish bin coloring ⋮ Strategic cooperation in cost sharing games ⋮ Pareto optimal equilibria for selfish bin packing with uniform cost sharing ⋮ Equilibria in a class of aggregative location games ⋮ Transportation network with externalities ⋮ The price of anarchy on uniformly related machines revisited ⋮ Scheduling games with rank-based utilities ⋮ Unnamed Item ⋮ Contribution games in networks ⋮ On equilibria for ADM minimization games ⋮ The Impact of Cooperation in Bilateral Network Creation ⋮ Pairwise cooperations in selfish ring routing for minimax linear latency ⋮ Approximate strong equilibria in job scheduling games with two uniformly related machines ⋮ Quality of equilibria for selfish bin packing with cost sharing variants ⋮ Selfish vector packing ⋮ The intermediate price of anarchy (IPoA) in bin packing games ⋮ On the tree conjecture for the network creation game ⋮ The price of optimum: complexity and approximation for a matching game ⋮ A game-theoretical model of the landscape theory ⋮ Item bidding for combinatorial public projects ⋮ Inefficiency of equilibria for the machine covering game on uniform machines ⋮ Strong Nash equilibria and mixed strategies ⋮ Competitive routing over time ⋮ Generalized graph \(k\)-coloring games ⋮ On the Existence of Pure Nash Equilibria in Weighted Congestion Games ⋮ Congestion Games with Multi-Dimensional Demands ⋮ Selfish load balancing for jobs with favorite machines ⋮ Negotiating team formation using deep reinforcement learning ⋮ Cost-sharing games in real-time scheduling systems ⋮ Cost-sharing games in real-time scheduling systems ⋮ Quality of strong equilibria for selfish bin packing with uniform cost sharing ⋮ Item Pricing for Combinatorial Public Projects ⋮ Efficient Black-Box Reductions for Separable Cost Sharing ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines ⋮ Balancing Load via Small Coalitions in Selfish Ring Routing Games ⋮ A note on the lower bound for the price of anarchy of scheduling games on unrelated machines ⋮ Equilibria in Multiclass and Multidimensional Atomic Congestion Games ⋮ Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines ⋮ Parametric packing of selfish items and the subset sum algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong equilibrium in cost sharing connection games
- Coalition-proof Nash equilibria. I: Concepts
- Stable networks
- Strong equilibrium in congestion games
- Network structure and strong equilibrium in route selection games.
- Potential games
- Crowding games are sequentially solvable
- Equilibrium and potential in coalitional congestion games
- Tradeoffs in worst-case equilibria
- A class of games possessing pure-strategy Nash equilibria
- The effect of collusion in congestion games
- On a network creation game
- How bad is selfish routing?
- The Price of Stability for Network Design with Fair Cost Allocation
- On nash equilibria for a network creation game
- Atomic Congestion Games Among Coalitions
- Algorithms, games, and the internet
- The price of selfish behavior in bilateral network formation
- Distributed computing meets game theory
- Strong Price of Anarchy for Machine Load Balancing
- Algorithms – ESA 2005
- Strategyproof sharing of submodular costs: budget balance versus efficiency
This page was built for publication: Strong price of anarchy
