On the sequential price of anarchy of isolation games
From MaRDI portal
Publication:2354304
DOI10.1007/s10878-013-9694-9zbMath1320.91030OpenAlexW2031859826MaRDI QIDQ2354304
Vittorio Bilò, Luca Moscardelli, Anna Angelucci, Michele Flammini
Publication date: 10 July 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-013-9694-9
Noncooperative games (91A10) Rationality and learning in game theory (91A26) Multistage and repeated games (91A20)
Related Items (5)
Multicast Network Design Game on a Ring ⋮ The quality of equilibria for set packing and throughput scheduling games ⋮ The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing ⋮ Improved bounds on equilibria solutions in the network design game ⋮ The sequential price of anarchy for affine congestion games with few players
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametric packing of selfish items and the subset sum algorithm
- Optimal strategies for the one-round discrete Voronoi game on a line
- Maximizing the minimum load: the cost of selfishness
- Selfish bin packing with cardinality constraints
- Selfish bin coloring
- Extending the notion of rationality of selfish agents: second order Nash equilibria
- Selfish bin packing
- Tight bounds for selfish and greedy load balancing
- On the performances of Nash equilibria in isolation games
- When ignorance helps: graphical multicast cost sharing games
- Non-cooperative facility location and covering games
- An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games
- The isolation game: a game of distances
- Maximizing the minimum load for selfish agents
- The one-round Voronoi game
- The cost of selfishness for maximizing the minimum load on uniformly related machines
- The price of stability for undirected broadcast network design with fair cost allocation is constant
- Improved lower bounds on the price of stability of undirected network design games
- Non-cooperative games
- The curse of simultaneity
- Some Anomalies of Farsighted Strategic Behavior
- Tight bounds for worst-case equilibria
- Exact Price of Anarchy for Polynomial Congestion Games
- How bad is selfish routing?
- Nash Equilibria in Voronoi Games on Graphs
- Near-optimal network design with selfish agents
- The price of anarchy of finite congestion games
- Voronoi Games on Cycle Graphs
- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
- Low Energy and Mutually Distant Sampling
- The price of selfish routing
- Competitive Location Models: A Framework and Bibliography
- Algorithms – ESA 2005
- The Price of Routing Unsplittable Flow
This page was built for publication: On the sequential price of anarchy of isolation games
