Sciweavers

1195 search results - page 25 / 239
» On allocations that maximize fairness
Sort
View
STACS
2005
Springer
14 years 2 months ago
Cost Sharing and Strategyproof Mechanisms for Set Cover Games
Abstract. We develop for set cover games several general cost-sharing methods that are approximately budget-balanced, core, and/or group-strategyproof. We first study the cost sha...
Xiang-Yang Li, Zheng Sun, Weizhao Wang
IOR
2008
82views more  IOR 2008»
13 years 9 months ago
Heavy-Traffic Optimality of a Stochastic Network Under Utility-Maximizing Resource Allocation
We study a stochastic network that consists of a set of servers processing multiple classes of jobs. Each class of jobs requires a concurrent occupancy of several servers while be...
Heng-Qing Ye, David D. Yao
IPPS
2007
IEEE
14 years 3 months ago
Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
Deng Pan, Yuanyuan Yang
VALUETOOLS
2006
ACM
166views Hardware» more  VALUETOOLS 2006»
14 years 2 months ago
Fairness considerations of scheduling in multi-server and multi-queue systems
— Multi-server and multi-queue architectures are common mechanisms used in a large variety of applications (call centers, Web services, computer systems). One of the major motiva...
David Raz, Benjamin Avi-Itzhak, Hanoch Levy
SIGMETRICS
2005
ACM
154views Hardware» more  SIGMETRICS 2005»
14 years 2 months ago
Fair operation of multi-server and multi-queue systems
Multi-server and multi-queue architectures are common mechanisms used in a large variety of applications (call centers, Web services, computer systems). One of the major motivatio...
David Raz, Benjamin Avi-Itzhak, Hanoch Levy