Totally Unimodular Congestion Games

DOI10.1137/1.9781611974782.37zbMath1417.91131arXiv1511.02784OpenAlexW2270201883WikidataQ57568063 ScholiaQ57568063MaRDI QIDQ4575774

Carla Michini, Michael C. Ferris, Alberto Del Pia

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial TU congestion gamestotally unimodular congestion games

Mathematics Subject Classification ID

Games involving graphs (91A43) Combinatorial games (91A46)

Related Items (5)

Equilibrium computation in resource allocation games ⋮ Computing equilibria for integer programming games ⋮ Approximate separable multichoice optimization over monotone systems ⋮ A Unified Framework for Pricing in Nonconvex Resource Allocation Games ⋮ Computation and efficiency of potential function minimizers of combinatorial congestion games

This page was built for publication: Totally Unimodular Congestion Games