Efficiency loss in a network resource allocation game: the case of elastic supply

DOI10.1109/TAC.2005.858687zbMath1366.91102MaRDI QIDQ5274197

Ramesh Johari, Shie Mannor, John N. Tsitsiklis

Publication date: 12 July 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Noncooperative games (91A10) Communication networks in operations research (90B18) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (14)

Three modeling paradigms in mathematical programming ⋮ The price of anarchy of serial, average and incremental cost sharing ⋮ The worst absolute surplus loss in the problem of commons: random priority versus average cost ⋮ Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game ⋮ Nash equilibrium design and price-based coordination in hierarchical systems ⋮ Inefficiency in stochastic queueing systems with strategic customers ⋮ Prices of anarchy, information, and cooperation in differential games ⋮ An efficient and almost budget balanced cost sharing method ⋮ Almost budget-balanced VCG mechanisms to assign multiple objects ⋮ On the efficiency of equilibria in mean-field oscillator games ⋮ Generalising diagonal strict concavity property for uniqueness of Nash equilibrium ⋮ Stochastic differential games and inverse optimal control and stopper policies ⋮ On the (In)efficiency of MFG Equilibria ⋮ Adversarial behavior in network games

This page was built for publication: Efficiency loss in a network resource allocation game: the case of elastic supply