64 search results - page 5 / 13 » On Low-Envy Truthful Allocations |
ESA
2008
Springer
13 years 8 months ago
2008
Springer
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
SIGECOM
2010
ACM
13 years 11 months ago
2010
ACM
The Combinatorial Public Projects Problem s an abstraction of resource allocation problems in which agents have preferences over alternatives, and an outcome that is to be collect...
SIGECOM
2008
ACM
13 years 6 months ago
2008
ACM
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
SIGECOM
2003
ACM
13 years 12 months ago
2003
ACM
We study auctions for a commodity in unlimited supply, e.g., a digital good. In particular we consider three desirable properties for auctions: • Competitive: the auction achiev...