### 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 | |

State | Published - Dec 1 2009 |

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 | Greece |

City | Volos |

Period | 6/10/09 → 6/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