Sciweavers

13 search results - page 1 / 3
» Characterizing false-name-proof allocation rules in combinat...
Sort
View
ATAL
2009
Springer
13 years 12 months ago
Characterizing false-name-proof allocation rules in combinatorial auctions
A combinatorial auction mechanism consists of an allocation rule that defines the allocation of goods for each agent, and a payment rule that defines the payment of each winner....
Taiki Todo, Atsushi Iwasaki, Makoto Yokoo, Yuko Sa...
AAAI
2010
13 years 6 months ago
Stability and Incentive Compatibility in a Kernel-Based Combinatorial Auction
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
Sébastien Lahaie
WECWIS
2007
IEEE
130views ECommerce» more  WECWIS 2007»
13 years 11 months ago
Improved Rules for the Resource Allocation Design
Iterative Combinatorial Auctions (ICA) have been getting increasing attention both from researchers and in practice as they can increase efficiency of complex markets with substi...
Pasha Shabalin, Bernd Laqua, Alexander Pikovsky
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
13 years 5 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
AAAI
2004
13 years 6 months ago
Methods for Boosting Revenue in Combinatorial Auctions
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...
Anton Likhodedov, Tuomas Sandholm