Sciweavers

186 search results - page 11 / 38
» Bounded Fairness
Sort
View
ECAI
2010
Springer
13 years 8 months ago
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...
Sylvain Bouveret, Ulle Endriss, Jérôm...
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
13 years 8 months ago
RFQ: Redemptive Fair Queuing
Fair-queuing schedulers provide clients with bandwidth or latency guarantees provided they are well-behaved i.e. the requested service is always within strict predefined limits. V...
Ajay Gulati, Peter J. Varman
TIT
2008
119views more  TIT 2008»
13 years 7 months ago
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
We address the question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time. We consider a simple distributed sched...
Prasanna Chaporkar, Koushik Kar, Xiang Luo, Saswat...
INFOCOM
1998
IEEE
13 years 12 months ago
On Adaptive Bandwidth Sharing with Rate Guarantees
The objective of recent research in fair queueing schemes has been to efficiently emulate a fluid-flow generalized (weighted) processor sharing (GPS) system, as closely as possibl...
Nick G. Duffield, T. V. Lakshman, Dimitrios Stilia...
TPDS
2008
92views more  TPDS 2008»
13 years 7 months ago
Max-Min Fair Scheduling in Input-Queued Switches
Fairness in traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate transient bottlenecks, mitigate the effect of cer...
Madhusudan Hosaagrahara, Harish Sethu