Welfare Measure for Resource Allocation with Algorithmic Implementation: Beyond Average and Max-Min

by   Ezra Tampubolon, et al.

In this work, we propose an axiomatic approach for measuring the performance/welfare of a system consisting of concurrent agents in a resource-driven system. Our approach provides a unifying view on popular system optimality principles, such as the maximal average/total utilities and the max-min fairness. Moreover, it gives rise to other system optimality notions that have not been fully exploited yet, such as the maximal lowest total subgroup utilities. For the axiomatically defined welfare measures, we provide a generic gradient-based method to find an optimal resource allocation and present a theoretical guarantee for its success. Lastly, we demonstrate the power of our approach through the power control application in wireless networks.


page 1

page 2

page 3

page 4


Optimization of LTE Radio Resource Block Allocation for Maritime Channels

In this study, we describe the behavior of LTE over the sea and investig...

Gradient and Projection Free Distributed Online Min-Max Resource Optimization

We consider distributed online min-max resource allocation with a set of...

Fair and Efficient Resource Allocation with Partial Information

We study the fundamental problem of allocating indivisible goods to agen...

The Constrained Round Robin Algorithm for Fair and Efficient Allocation

We consider a multi-agent resource allocation setting that models the as...

Equitable Division of a Path

We study fair resource allocation under a connectedness constraint where...

Resource allocation under uncertainty: an algebraic and qualitative treatment

We use an algebraic viewpoint, namely a matrix framework to deal with th...

The Power Allocation Game on A Network: A Paradox

The well-known Braess paradox in congestion games states that adding an ...