Approximately optimal utility maximization

Angelia Nedić; Vijay G. Subramanian

doi:10.1109/ITWNIT.2009.5158572

Approximately optimal utility maximization

Angelia Nedić, Vijay G. Subramanian

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Scopus citations

Abstract

All opportunistic scheduling algorithms solve simpler optimization problems at each scheduling instance in order to achieve good long-term performance. The analysis of these algorithms assumes that the simpler optimization problems are solved exactly. However, in contrast, real-life implementations only approximately solve these problems but still yield close to optimal performance. We formalize this observation by explicitly bounding the longterm performance in terms of the error in the approximation made at every stage.

Original language	English (US)
Title of host publication	Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009
Pages	206-210
Number of pages	5
DOIs	https://doi.org/10.1109/ITWNIT.2009.5158572
State	Published - 2009
Externally published	Yes
Event	2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009 - Volos, Greece Duration: Jun 10 2009 → Jun 12 2009

Publication series

Name	Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009

Other

Other	2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009
Country/Territory	Greece
City	Volos
Period	6/10/09 → 6/12/09

ASJC Scopus subject areas

Computer Networks and Communications
Information Systems
Communication

Access to Document

10.1109/ITWNIT.2009.5158572

Cite this

Approximately optimal utility maximization. / Nedić, Angelia; Subramanian, Vijay G.
Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009. 2009. p. 206-210 5158572 (Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Nedić, A & Subramanian, VG 2009, Approximately optimal utility maximization. in Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009., 5158572, Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009, pp. 206-210, 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009, Volos, Greece, 6/10/09. https://doi.org/10.1109/ITWNIT.2009.5158572

@inproceedings{c03824442604471a930f62ec6405dbf7,

title = "Approximately optimal utility maximization",

abstract = "All opportunistic scheduling algorithms solve simpler optimization problems at each scheduling instance in order to achieve good long-term performance. The analysis of these algorithms assumes that the simpler optimization problems are solved exactly. However, in contrast, real-life implementations only approximately solve these problems but still yield close to optimal performance. We formalize this observation by explicitly bounding the longterm performance in terms of the error in the approximation made at every stage.",

author = "Angelia Nedi{\'c} and Subramanian, {Vijay G.}",

year = "2009",

doi = "10.1109/ITWNIT.2009.5158572",

language = "English (US)",

isbn = "9781424445363",

series = "Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009",

pages = "206--210",

booktitle = "Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009",

note = "2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009 ; Conference date: 10-06-2009 Through 12-06-2009",

}

TY - GEN

T1 - Approximately optimal utility maximization

AU - Nedić, Angelia

AU - Subramanian, Vijay G.

PY - 2009

Y1 - 2009

N2 - All opportunistic scheduling algorithms solve simpler optimization problems at each scheduling instance in order to achieve good long-term performance. The analysis of these algorithms assumes that the simpler optimization problems are solved exactly. However, in contrast, real-life implementations only approximately solve these problems but still yield close to optimal performance. We formalize this observation by explicitly bounding the longterm performance in terms of the error in the approximation made at every stage.

AB - All opportunistic scheduling algorithms solve simpler optimization problems at each scheduling instance in order to achieve good long-term performance. The analysis of these algorithms assumes that the simpler optimization problems are solved exactly. However, in contrast, real-life implementations only approximately solve these problems but still yield close to optimal performance. We formalize this observation by explicitly bounding the longterm performance in terms of the error in the approximation made at every stage.

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

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

U2 - 10.1109/ITWNIT.2009.5158572

DO - 10.1109/ITWNIT.2009.5158572

M3 - Conference contribution

AN - SCOPUS:77950671552

SN - 9781424445363

T3 - Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009

SP - 206

EP - 210

BT - Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009

T2 - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009

Y2 - 10 June 2009 through 12 June 2009

ER -

Approximately optimal utility maximization

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this