Arrow Research search
Back to MFCS

MFCS 2007

Selfish Load Balancing Under Partial Knowledge

Conference Paper Equilibria Algorithms and Complexity ยท Theoretical Computer Science

Abstract

Abstract We consider n selfish agents or players, each having a load, who want to place their loads to one of two bins. The agents have an incomplete picture of the world: They know some loads exactly and only a probability distribution for the rest. We study Nash equilibria for this model, we compute the Price of Anarchy for some cases and show that sometimes extra information adversely affects the Divergence Ratio (a kind of subjective Price of Anarchy).

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
International Symposium on Mathematical Foundations of Computer Science
Archive span
1973-2025
Indexed papers
3045
Paper id
419849936954862718