40 search results - page 1 / 8 » On characterizations of truthful mechanisms for combinatoria... |
SIGECOM
2008
ACM
13 years 4 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...
WINE
2007
Springer
13 years 11 months ago
2007
Springer
This paper characterizes the family of truthful doublesided auctions. Despite the importance of double-sided auctions to market design, to date no characterization of truthful dou...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
This paper analyzes implementable social choice functions (in dominant strategies) over restricted domains of preferences, the leading example being combinatorial auctions. Our wo...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...