Resource Competition on Integral Polymatroids
Resource Competition on Integral Polymatroids
复制标题
积分多阵资源竞赛
DOI:
10.1007/978-3-319-13129-0_14
复制
发表时间:
2014
期刊:
影响因子:
--
通讯作者:
Britta Peis
中科院分区:
文献类型:
--
作者:
Tobias Harks;Max Klimm;Britta Peis
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.
DOI:
--
发表时间:
2011
期刊:
TALG
影响因子:
--
作者:
Martin Gairing;B. Monien;Karsten Tiemann
通讯作者:
Karsten Tiemann
影响因子:
0.8
作者:
U. Faigle
通讯作者:
U. Faigle
DOI:
--
发表时间:
2003
期刊:
International Symposium on Mathematical Foundations of Computer Science
影响因子:
--
作者:
Piotr Krysta;P. Sanders;Berthold Vöcking
通讯作者:
Berthold Vöcking