Sciweavers

20 search results - page 2 / 4
» Using value queries in combinatorial auctions
Sort
View
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
ATAL
2004
Springer
13 years 10 months ago
Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions
Combinatorial auctions, where agents can bid on bundles of items (resources, tasks, etc.), are desirable because the agents can express complementarity and substitutability among ...
Benoît Hudson, Tuomas Sandholm
IJCAI
2001
13 years 6 months ago
Robust Multi-unit Auction Protocol against False-name Bids
This paper presents a new multi-unit auction protocol (IR protocol) that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commerce a...
Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara
WINE
2007
Springer
140views Economy» more  WINE 2007»
13 years 11 months ago
Empirical Price Modeling for Sponsored Search
We present a characterization of empirical price data from sponsored search auctions. We show that simple models drawing bid values independently from a fixed distribution can be...
Kuzman Ganchev, Alex Kulesza, Jinsong Tan, Ryan Ga...
SIGECOM
2003
ACM
143views ECommerce» more  SIGECOM 2003»
13 years 10 months ago
Differential-revelation VCG mechanisms for combinatorial auctions
Combinatorial auctions, where bidders can submit bids on bundles of items, are economically efficient mechanisms for selling items to bidders, and are attractive when the bidders...
Wolfram Conen, Tuomas Sandholm