Approximately optimal utility maximization

Angelia Nedich, Vijay G. Subramanian

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationProceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009
Pages206-210
Number of pages5
DOIs
StatePublished - Dec 1 2009
Event2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009 - Volos, Greece
Duration: Jun 10 2009Jun 12 2009

Publication series

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

Other

Other2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009
CountryGreece
CityVolos
Period6/10/096/12/09

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Communication

Fingerprint Dive into the research topics of 'Approximately optimal utility maximization'. Together they form a unique fingerprint.

  • Cite this

    Nedich, A., & Subramanian, V. G. (2009). Approximately optimal utility maximization. In Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009 (pp. 206-210). [5158572] (Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009). https://doi.org/10.1109/ITWNIT.2009.5158572