Some anomalies of farsighted strategic behavior

DOI10.1007/s00224-013-9529-1zbMath1311.91023OpenAlexW2080563857MaRDI QIDQ2344212

Gianpiero Monaco, Vittorio Bilò, Luca Moscardelli, Michele Flammini

Publication date: 12 May 2015

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-013-9529-1

zbMATH Keywords

subgame perfect equilibriacut gamesscheduling gamessequential price of anarchycost sharing games

Mathematics Subject Classification ID

Games involving graphs (91A43) Applications of game theory (91A80) (n)-person games, (n>2) (91A06) Games in extensive form (91A18) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

On the performance of mildly greedy players in cut games ⋮ The quality of equilibria for set packing and throughput scheduling games ⋮ The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing ⋮ Exact price of anarchy for weighted congestion games with two players ⋮ On lookahead equilibria in congestion games ⋮ A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games ⋮ The sequential price of anarchy for affine congestion games with few players ⋮ On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence and approximation in potential games
• Network movement games
• Extending the notion of rationality of selfish agents: second order Nash equilibria
• Tight bounds for selfish and greedy load balancing
• On best response dynamics in weighted congestion games with polynomial delays
• When ignorance helps: graphical multicast cost sharing games
• Designing fast converging cost sharing methods for multicast transmissions
• Non-cooperative games
• The curse of simultaneity
• On a network creation game
• Selfish Traffic Allocation for Server Farms
• The speed of convergence in congestion games under best-response dynamics
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• The price of anarchy of finite congestion games
• On the Value of Coordination in Network Design
• On the Complexity of Cooperative Solution Concepts
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Algorithmic Game Theory
• Equilibrium points in n -person games