64 search results - page 4 / 13 » On Low-Envy Truthful Allocations |
100
Voted
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
71
Voted
IWQOS
2004
Springer
15 years 2 months ago
2004
Springer
— Equitable bandwidth allocation is essential when QoS requirements and purchasing power vary among users. To this end, we present a mechanism for bandwidth allocation based on d...
81
Voted
CLUSTER
2002
IEEE
15 years 2 months ago
2002
IEEE
Computational Grids are large scale computing system composed of geographically distributed resources (computers, storage etc.) owned by self interested agents or organizations. T...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—We consider the problem of ’fair’ scheduling the resources to one of the many mobile stations by a centrally controlled base station (BS). The BS is the only entity taking d...
WINE
2009
Springer
15 years 4 months ago
2009
Springer
We improve the best known competitive ratio (from 1/4 to 1/2), for the online multi-unit allocation problem, where the objective is to maximize the single-price revenue. Moreover, ...