Selfish Routing and Proportional Resource Allocation

Andreas S. Schulz ()
Additional contact information
Andreas S. Schulz: Technische Universität München, Fakultät für Mathematik und Fakultät für Wirtschaftswissenschaften

A chapter in Gems of Combinatorial Optimization and Graph Algorithms, 2015, pp 95-102 from Springer

Abstract: Abstract We consider two optimization problems, multicommodity flow and resource allocation, from a game-theoretic point of view. We show that two known bounds on the respective losses of optimality can be derived from the same geometric quantity, which yields a simple proof of either result.

Keywords: Nash Equilibrium; Equilibrium Allocation; Equilibrium Flow; Feasible Allocation; Large Rectangle (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-24971-1_9

Ordering information: This item can be ordered from
http://www.springer.com/9783319249711

DOI: 10.1007/978-3-319-24971-1_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().