Sciweavers

44 search results - page 6 / 9
» Mechanism Design for Complexity-Constrained Bidders
Sort
View
SIGECOM
2004
ACM
112views ECommerce» more  SIGECOM 2004»
14 years 4 months ago
Self-interested automated mechanism design and implications for optimal combinatorial auctions
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
Vincent Conitzer, Tuomas Sandholm
AAAI
2007
14 years 1 months ago
Automated Online Mechanism Design and Prophet Inequalities
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tu...
FC
2003
Springer
133views Cryptology» more  FC 2003»
14 years 4 months ago
Secure Generalized Vickrey Auction Using Homomorphic Encryption
Combinatorial auctions have recently attracted the interest of many researchers due to their promising applications such as the spectrum auctions recently held by the FCC. In a com...
Koutarou Suzuki, Makoto Yokoo
IJCAI
2001
14 years 8 days ago
Bidding Languages for Combinatorial Auctions
Combinatorial auctions provide a valuable mechanism for the allocation of goods in settings where buyer valuations exhibit complex structure with respect to substitutabilityand co...
Craig Boutilier, Holger H. Hoos
AMAI
2005
Springer
13 years 10 months ago
Auction design with costly preference elicitation
We consider auction design in a setting with costly preference elicitation. Well designed auctions can help to avoid unnecessary elicitation while determining efficient allocations...
David C. Parkes