Abstract
We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of $m$ resources by $n$ selfish agents. Each agent has an individual demand; demands are drawn according to some probability distribution. The cost paid by an agent for a resource she chooses is the total demand put on the resource divided by the number of agents who chose that same resource. So, resources charge costs in an equitable, fair way, while each resource makes no profit out of the agents.
We call our model the Fair Pricing model. Its fair cost mechanism induces a noncooperative game among the agents. To evaluate the Nash equilibria of this game, we introduce the Diffuse Price of Anarchy, as an extension of the Price of Anarchy that takes into account the probability distribution on the demands. We prove:
(1) Pure Nash equilibria may not exist, unless all chosen demands are identical; in contrast, a fully mixed Nash equilibrium exists for all possible choices of the demands. Further on, the fully mixed Nash equilibrium is the unique Nash equilibrium in case there are only two agents.
(2) In the worstcase choice of demands, the Price of Anarchy is $Theta (n)$;
for the special case of two agents, the Price of Anarchy is less than $2  frac{1}{m}$.
(3) Assume now that demands are drawn from a bounded, independent probability distribution, where all demands are identically distributed and each is at most a (universal for the class) constant times its expectation. Then, the Diffuse Price of Anarchy is at most that same constant, which is just $2$ when each demand is distributed symmetrically around its expectation.
BibTeX  Entry
@InProceedings{mavronicolas_et_al:DSP:2006:564,
author = {Marios Mavronicolas and Panagiota Panagopoulou and Paul G. Spirakis},
title = {A Cost Mechanism for Fair Pricing of Resource Usage},
booktitle = {Algorithmic Aspects of Large and Complex Networks},
year = {2006},
editor = {Stefano Leonardi and Friedhelm Meyer auf der Heide and Dorothea Wagner},
number = {05361},
series = {Dagstuhl Seminar Proceedings},
ISSN = {18624405},
publisher = {Internationales Begegnungs und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2006/564},
annote = {Keywords: Cost Sharing, Diffuse Price of Anarchy, Fair Pricing, Resources}
}
Keywords: 

Cost Sharing, Diffuse Price of Anarchy, Fair Pricing, Resources 
Collection: 

05361  Algorithmic Aspects of Large and Complex Networks 
Issue Date: 

2006 
Date of publication: 

08.05.2006 