On Pareto-efficiency between revenue and utility in resource allocation

Authors:
Ki-Dong Lee;Tak-Shing Peter Yum
Affiliations:
LG Electronics Mobile Research, San Diego, CA;Chinese University of Hong Kong, Hong Kong
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 6
Cited 0

A resource estimation and call admission algorithm for wireless multimedia networks using the shadow cluster concept

IEEE/ACM Transactions on Networking (TON)
A game theoretic framework for bandwidth allocation and pricing in broadband networks

IEEE/ACM Transactions on Networking (TON)
Uniform power allocation in MIMO channels: a game-theoretic approach

IEEE Transactions on Information Theory
Distributed call admission control in mobile/wireless networks

IEEE Journal on Selected Areas in Communications
Dynamic resource allocation schemes during handoff for mobile multimedia wireless networks

IEEE Journal on Selected Areas in Communications
A real-time algorithm for timeslot assignment in multirate return channels of interactive satellite multimedia networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the broadband mobile service market, it is reasonable that the carrier (service provider) should choose a Pareto-efficient resource allocation policy so that both the revenue of the carrier and the utility of users can be maximized. In this paper, we investigate the fundamental problem of the existence of resource allocation policies that are Pareto-efficient between the revenue and the utility. We show that the revenue-maximizing policy is not always equal to the utility-maximizing policy and that the two distinct policies, if any, generate a set of Pareto-efficient resource allocation policies. To make a Pareto-efficient resource allocation schedule, we develop a mathematical framework, where we study the existence of the Pareto-efficient policies, a necessary and sufficient condition for Pareto-efficiency, which can be used for finding the set of all the Pareto-efficient policies, and an efficient and exact solution method to find a Pareto-efficient resource allocation schedule.