Selfish routing and proportional resource allocation: A joint bound on the loss of optimality

Andreas S. Schulz

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

Selfish routing and proportional resource allocation: A joint bound on the loss of optimality

Andreas S. Schulz

Chair of Operations Research

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

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.

Original language	English
Title of host publication	Gems of Combinatorial Optimization and Graph Algorithms
Publisher	Springer International Publishing
Pages	95-102
Number of pages	8
ISBN (Electronic)	9783319249711
ISBN (Print)	9783319249704
DOIs	https://doi.org/10.1007/978-3-319-24971-1_9
State	Published - 31 Jan 2016

Access to Document

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

Cite this

@inbook{001528ab56fe4c87b38ddbc76bc0a09e,

title = "Selfish routing and proportional resource allocation: A joint bound on the loss of optimality",

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.",

author = "Schulz, {Andreas S.}",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2017.",

year = "2016",

month = jan,

day = "31",

doi = "10.1007/978-3-319-24971-1_9",

language = "English",

isbn = "9783319249704",

pages = "95--102",

booktitle = "Gems of Combinatorial Optimization and Graph Algorithms",

publisher = "Springer International Publishing",

}

TY - CHAP

T1 - Selfish routing and proportional resource allocation

T2 - A joint bound on the loss of optimality

AU - Schulz, Andreas S.

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2017.

PY - 2016/1/31

Y1 - 2016/1/31

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85055440803&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-24971-1_9

DO - 10.1007/978-3-319-24971-1_9

M3 - Chapter

AN - SCOPUS:85055440803

SN - 9783319249704

SP - 95

EP - 102

BT - Gems of Combinatorial Optimization and Graph Algorithms

PB - Springer International Publishing

ER -

Selfish routing and proportional resource allocation: A joint bound on the loss of optimality

Abstract

Access to Document

Other files and links

Fingerprint

Cite this