Strong price of anarchy
From MaRDI portal
Publication:1007765
DOI10.1016/J.GEB.2008.03.005zbMATH Open1156.91419DBLPjournals/geb/AndelmanFM09OpenAlexW1972926214WikidataQ92407013 ScholiaQ92407013MaRDI QIDQ1007765FDOQ1007765
Authors: Nir Andelman, Michal Feldman, 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
Recommendations
coalitionsprice of anarchynetwork formationjob schedulingcongestion gamesstrong equilibriumstrong price of anarchy
Cites Work
- 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
- Stable networks
- Title not available (Why is that?)
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- Atomic Congestion Games Among Coalitions
- Strong equilibrium in cost sharing connection games
- Network structure and strong equilibrium in route selection games.
- Algorithms, games, and the internet
- Algorithms – ESA 2005
- On a network creation game
- On nash equilibria for a network creation game
- The price of selfish behavior in bilateral network formation
- Distributed computing meets game theory
- The effect of collusion in congestion games
- Strong equilibrium in congestion games
- Title not available (Why is that?)
- Collusion-resistant mechanisms for single-parameter agents
- Tradeoffs in worst-case equilibria
- Title not available (Why is that?)
- Crowding games are sequentially solvable
- Equilibrium and potential in coalitional congestion games
Cited In (64)
- The price of anarchy on uniformly related machines revisited
- Strong Nash equilibria and mixed strategies
- Multitask \(n\)-vehicle exploration problem: complexity and algorithm
- On the tree conjecture for the network creation game
- Quality of equilibria for selfish bin packing with cost sharing variants
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- Coordination games on graphs
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- Parametric packing of selfish items and the subset sum algorithm
- Inefficiency of equilibria for the machine covering game on uniform machines
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing
- Selfish load balancing for jobs with favorite machines
- Strong Price of Anarchy for Machine Load Balancing
- Selfish bin coloring
- A game-theoretical model of the landscape theory
- Approximate strong equilibria in job scheduling games with two uniformly related machines
- On tree equilibria in max-distance network creation games
- Generalized graph \(k\)-coloring games
- Efficient black-box reductions for separable cost sharing
- Efficient black-box reductions for separable cost sharing
- On the existence of pure Nash equilibria in weighted congestion games
- Transportation network with externalities
- Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines
- Pairwise cooperations in selfish ring routing for minimax linear latency
- Cost-sharing scheduling games on restricted unrelated machines
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Strong equilibrium in cost sharing connection games
- Item Pricing for Combinatorial Public Projects
- Strong and Pareto Price of Anarchy in Congestion Games
- Negotiating team formation using deep reinforcement learning
- Scheduling games with rank-based utilities
- Strong price of anarchy, utility games and coalitional dynamics
- Cost-sharing scheduling games on restricted unrelated machines
- Strong price of anarchy
- Cost-sharing games in real-time scheduling systems
- Congestion Games with Multi-Dimensional Demands
- Scheduling selfish jobs on multidimensional parallel machines
- The quality of equilibria for set packing and throughput scheduling games
- Coordination mechanisms for scheduling selfish jobs with favorite machines
- Contribution games in networks
- Competitive routing over time
- Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness
- On the complexity of Pareto-optimal Nash and strong equilibria
- On the complexity of Pareto-optimal Nash and strong equilibria
- Strong equilibria in games with the lexicographical improvement property
- The intermediate price of anarchy (IPoA) in bin packing games
- Implementing efficient graphs in connection networks
- Equilibria in a class of aggregative location games
- Equilibria in Multiclass and Multidimensional Atomic Congestion Games
- A unified framework for strong price of anarchy in clustering games
- The price of optimum: complexity and approximation for a matching game
- On the tree conjecture for the network creation game
- Selfish vector packing
- Selfish vector packing
- On equilibria for ADM minimization games
- Strategic cooperation in cost sharing games
- A note on the lower bound for the price of anarchy of scheduling games on unrelated machines
- Item bidding for combinatorial public projects
- Balancing Load via Small Coalitions in Selfish Ring Routing Games
- Cost-sharing games in real-time scheduling systems
- The Impact of Cooperation in Bilateral Network Creation
- Social distancing network creation
- Sequential solutions in machine scheduling games
- The price of anarchy for a berth allocation game
This page was built for publication: Strong price of anarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007765)
