Show simple item record

dc.contributor.authorMavronicolas, Mariosen
dc.contributor.authorPanagopoulou, P. N.en
dc.contributor.authorSpirakis, Paul G.en
dc.creatorMavronicolas, Mariosen
dc.creatorPanagopoulou, P. N.en
dc.creatorSpirakis, Paul G.en
dc.date.accessioned2019-11-13T10:41:14Z
dc.date.available2019-11-13T10:41:14Z
dc.date.issued2008
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/54515
dc.description.abstractWe 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 demanden
dc.description.abstractdemands are drawn according to some probability distribution. The cost paid by an agent for a resource it 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 non-cooperative 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: • Pure Nash equilibria may not exist, unless all chosen demands are identical. • 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. • In the worst-case choice of demands, the Price of Anarchy is Θ(n)en
dc.description.abstractfor the special case of two agents, the Price of Anarchy is less than 2 - 1/m. • Assume now that demands are drawn from a bounded, independent probability distribution, where all demands are identically distributed, and each demand may not exceed some (universal for the class) constant times its expectation. It happens that the constant is just 2 when each demand is distributed symmetrically around its expectation. We prove that, for asymptotically large games where the number of agents tends to infinity, the Diffuse Price of Anarchy is at most that universal constant. This implies the first separation between Price of Anarchy and Diffuse Price of Anarchy. Towards the end, we consider two closely related cost sharing models, namely the Average Cost Pricing and the Serial Cost Sharing models, inspired by Economic Theory. In contrast to the Fair Pricing model, we prove that pure Nash equilibria do exist for both these models. © 2007 Springer Science+Business Media, LLC.en
dc.sourceAlgorithmica (New York)en
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-49149105177&doi=10.1007%2fs00453-007-9108-4&partnerID=40&md5=c9981d995ea9aa6c5fe4e2be785810dc
dc.subjectEconomicsen
dc.subjectNash equilibriumen
dc.subjectResourcesen
dc.subjectGame theoryen
dc.subjectRandom processesen
dc.subjectProbabilityen
dc.subjectTelecommunication networksen
dc.subjectProbability distributionsen
dc.subjectSeparationen
dc.subjectPrice of anarchyen
dc.subjectAgentsen
dc.subjectMechanismsen
dc.subjectNash equilibriaen
dc.subjectAverage costen
dc.subjectCost sharingen
dc.subjectDiffuse price of anarchyen
dc.subjectEconomic theoriesen
dc.subjectFair pricingen
dc.subjectNon-cooperative gamesen
dc.subjectPure Nash equilibriaen
dc.subjectResource usageen
dc.subjectSelfish Agentsen
dc.titleCost sharing mechanisms for fair pricing of resource usageen
dc.typeinfo:eu-repo/semantics/article
dc.identifier.doi10.1007/s00453-007-9108-4
dc.description.volume52
dc.description.issue1
dc.description.startingpage19
dc.description.endingpage43
dc.author.faculty002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences
dc.author.departmentΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeArticleen
dc.description.notes<p>Cited By :2</p>en
dc.source.abbreviationAlgorithmica (New York)en
dc.contributor.orcidSpirakis, Paul G. [0000-0001-5396-3749]
dc.gnosis.orcid0000-0001-5396-3749


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record