Resource Competition on Integral Polymatroids

We study competitive resource allocation problems in which players distribute their demands integrally over a set of resources subject to player-specific submodular capacity constraints. Each player has to pay for each unit of demand a cost that is a non-decreasing and convex function of the total a...

Full description

Saved in:
Bibliographic Details
Published inWeb and Internet Economics Vol. 8877; pp. 189 - 202
Main Authors Harks, Tobias, Klimm, Max, Peis, Britta
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2014
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Computer science
Congestion Game
Pure Nash Equilibrium
Rank Function
Resource Competition
Strategy Space
Online AccessGet full text
ISBN9783319131283
3319131281
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-13129-0_14

Cover

More Information
Summary:We study competitive resource allocation problems in which players distribute their demands integrally over a set of resources subject to player-specific submodular capacity constraints. Each player has to pay for each unit of demand a cost that is a non-decreasing and convex function of the total allocation of that resource. This general model of resource allocation generalizes both singleton congestion games with integer-splittable demands and matroid congestion games with player-specific costs. As our main result, we show that in such general resource allocation problems a pure Nash equilibrium is guaranteed to exist by giving a pseudo-polynomial algorithm computing a pure Nash equilibrium.
ISBN:9783319131283
3319131281
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-13129-0_14