Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games
From MaRDI portal
Publication:2835665
DOI10.1007/978-3-319-45587-7_9zbMath1432.91029arXiv1512.01375OpenAlexW2955411360MaRDI QIDQ2835665
Veerle Timmermans, Tobias Harks
Publication date: 30 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.01375
Applications of graph theory (05C90) Noncooperative games (91A10) Games involving graphs (91A43) Combinatorial aspects of matroids and geometric lattices (05B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (1)
Cites Work
- Resource buying games
- Stackelberg strategies and collusion in network games with splittable flow
- Pure Nash equilibria in player-specific and weighted congestion games
- A polynomial cycle canceling algorithm for submodular flows
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Local smoothness and the price of anarchy in splittable congestion games
- Equilibrium computation in atomic splittable singleton congestion games
- The uniqueness property for networks with several origin-destination pairs
- Submodular functions and independence structures
- Resource Competition on Integral Polymatroids
- Collusion in Atomic Splittable Routing Games
- The Impact of Oligopolistic Competition in Networks
- On the impact of combinatorial structure on congestion games
- On the relationship between Nash—Cournot and Wardrop equilibria
- Discrete Convex Analysis
- Competitive routing in networks with polynomial costs
- Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
- Comments on bases in dependence structures
- Exchange systems, matchings, and transversals
- Topological Conditions for Uniqueness of Equilibrium in Networks
This page was built for publication: Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games
