Uniqueness of equilibria in atomic splittable polymatroid congestion games

DOI10.1007/s10878-017-0166-5zbMath1411.91141OpenAlexW2963049412WikidataQ59528380 ScholiaQ59528380MaRDI QIDQ1631639

Veerle Timmermans, Tobias Harks

Publication date: 6 December 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0166-5

zbMATH Keywords

polymatroiduniqueness of equilibriacongestion game

Mathematics Subject Classification ID

Applications of graph theory (05C90) Noncooperative games (91A10) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function

Cites Work

• Unnamed Item
• Stackelberg strategies and collusion in network games with splittable flow
• Pure Nash equilibria in player-specific and weighted congestion games
• Planar graphs: Theory and algorithms
• Combinatorial algorithms on a class of graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Local smoothness and the price of anarchy in splittable congestion games
• The uniqueness property for networks with several origin-destination pairs
• Submodular functions and independence structures
• A class of games possessing pure-strategy Nash equilibria
• Submodular functions and optimization.
• Resource Competition on Integral Polymatroids
• Collusion in Atomic Splittable Routing Games
• The Impact of Oligopolistic Competition in Networks
• Capacity allocation under noncooperative routing
• 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
• Matroids Are Immune to Braess’ Paradox
• Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
• Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
• 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