Sciweavers

64 search results - page 2 / 13
» On Low-Envy Truthful Allocations
Sort
View
CORR
2011
Springer
180views Education» more  CORR 2011»
12 years 9 months ago
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
Lisa Fleischer, Zhenghui Wang
NCA
2003
IEEE
13 years 10 months ago
A Truthful Mechanism for Fair Load Balancing in Distributed Systems
In this paper we consider the problem of designing load balancing protocols in distributed systems where the participants (e.g. computers, users) are capable of manipulating the l...
Daniel Grosu, Anthony T. Chronopoulos
INFOCOM
2012
IEEE
11 years 7 months ago
Truthful prioritization schemes for spectrum sharing
Abstract—As the rapid expansion of smart phones and associated data-intensive applications continues, we expect to see renewed interest in dynamic prioritization schemes as a way...
Victor Shnayder, Jeremy Hoon, David C. Parkes, Vik...
WINE
2009
Springer
178views Economy» more  WINE 2009»
13 years 12 months ago
The Geometry of Truthfulness
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...
Angelina Vidali
MOBIHOC
2009
ACM
14 years 2 days ago
Revenue generation for truthful spectrum auction in dynamic spectrum access
Spectrum is a critical yet scarce resource and it has been shown that dynamic spectrum access can significantly improve spectrum utilization. To achieve this, it is important to ...
Juncheng Jia, Qian Zhang, Qin Zhang, Mingyan Liu