Using approximate majorization to characterize protocol fairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Applications of approximation algorithms to cooperative games
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Network QoS games: stability vs optimality tradeoff
Journal of Computer and System Sciences
Fairness and optimality in congestion games
Proceedings of the 6th ACM conference on Electronic commerce
Approximate majorization and fair online load balancing
ACM Transactions on Algorithms (TALG)
Pricing for fairness: distributed resource allocation for multiple objectives
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Opportunistic fair scheduling for the downlink of IEEE 802.16 wireless metropolitan area networks
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
An approximation algorithm for max-min fair allocation of indivisible goods
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Bi-objective Optimization: An Online Algorithm for Job Assignment
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
An evaluation of fair packet schedulers using a novel measure of instantaneous fairness
Computer Communications
The Efficiency of Fair Division
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
A general branch-and-bound algorithm for fair division problems
Computers and Operations Research
Operations Research
A generic coordination mechanism for lot-sizing in supply chains
Electronic Commerce Research
Bandwidth allocation in networks: a single dual update subroutine for multiple objectives
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
On the latency and fairness characteristics of pre-order deficit round Robin
Computer Communications
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, with one coordinate representing each individual. Motivated by work in network routing and bandwidth assignment, we consider the problem of producing solutions that simultaneously approximate all feasible allocations in a coordinate-wise sense. This is a very strong type of "global" approximation guarantee, and we explore its consequences in a range of discrete optimization problems, including facility location, scheduling, and bandwidth assignment in networks. A fundamental issue-one not encountered in the traditional design of approximation algorithms-is that good approximations in this global sense need not exist for every problem instance; there is no a priori reason why there should be an allocation that simultaneously approximates all others. As a result, the existential questions concerning such good allocations lead to a new perspective on a number of basic problems in resource allocation, and on the structure of their feasible solutions.