@inbook{1289856a6a0a441fa3adf2ec3d4445ce,

title = "Resource competition on integral polymatroids",

abstract = "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.",

author = "T. Harks and M. Klimm and B. Peis",

year = "2014",

month = jan,

day = "1",

doi = "10.1007/978-3-319-13129-0_14",

language = "English",

isbn = "978-3-319-13128-3",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

number = "8877",

pages = "189--202",

editor = "T. Liu and Q. Qi and Y. Ye",

booktitle = "Web and Internet Economics",

address = "United States",

}