Resource Competition on Integral Polymatroids

DOI10.1007/978-3-319-13129-0_14zbMath1406.91218arXiv1407.7650OpenAlexW16002891MaRDI QIDQ2936985

Tobias Harks, Max Klimm, Britta Peis

Publication date: 7 January 2015

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.7650

zbMATH Keywords

matroid congestion gamescompetitive resource allocationsingleton congestion games

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items (7)

Uniqueness of equilibria in atomic splittable polymatroid congestion games ⋮ Network-formation games with regular objectives ⋮ On a Reduction for a Class of Resource Allocation Problems ⋮ Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids ⋮ A logarithmic approximation for polymatroid congestion games ⋮ Efficiency of Equilibria in Uniform Matroid Congestion Games ⋮ Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games

This page was built for publication: Resource Competition on Integral Polymatroids