Home › Categories › Science & Nature› Price Of Anarchy In Finite Congestion Games

Price Of Anarchy In Finite Congestion Games.pdf

paper-ck05.pdf

Preview of Price of Anarchy in Finite Congestion Games

🔗 Source: cgi.di.uoa.gr

📊 Size: 133 KB

📄 Pages: 11 pages

⬇️ Downloads: 41

Summary

The price of anarchy measures the performance degradation when self-interested players make decisions without coordination. Key findings include:

- Asymmetric Games: For asymmetric games (different strategies for different players), the price of anarchy for both maximum and average social cost is Θ(√N), where N is the number of players.
- Symmetric Games: In symmetric games, the price of anarchy is 5/2 for both maximum and average social cost.
- Polynomial Latencies: Results extend to latency functions that are polynomials of bounded degree, with corresponding price of anarchy bounds.
- Mixed Nash Equilibria: The analysis also considers mixed Nash equilibria (a combination of pure strategies), achieving a price of anarchy bound of at most 2.619.

The study covers both discrete and continuous cases, building on previous work in congestion games and network routing models.

Download File

Description

For asymmetric games, it finds a √N factor deterioration, while for symmetric and other cases, the price of anarchy is 5/2, applicable to both maximum and average social cost calculations.

Technical Information

File Format: PDF
File Size: 133 KB
Pages: 11
Language: EN
Total Downloads: 41
Last Updated: 1 week ago

Document Overview

This PDF document about Price of Anarchy in Finite Congestion Games provides comprehensive information and guidance. Whether you're a beginner or advanced user, this resource offers valuable insights into Price of Anarchy in Finite Congestion Games.