Sciweavers

4 search results - page 1 / 1
» False-name-proofness with bid withdrawal
Sort
View
IAT
2008
IEEE
13 years 11 months ago
Beyond Quasi-linear Utility: Strategy/False-Name-Proof Multi-unit Auction Protocols
We develop strategy/false-name-proof multi-unit auction protocols for non-quasi-linear utilities. One almost universal assumption in auction theory literature is that each bidder ...
Yuko Sakurai, Yasumasa Saito, Atsushi Iwasaki, Mak...
ATAL
2010
Springer
13 years 5 months ago
False-name-proofness with bid withdrawal
We study a more powerful variant of false-name manipulation in Internet auctions: an agent can submit multiple false-name bids, but then, once the allocation and payments have bee...
Mingyu Guo, Vincent Conitzer
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
13 years 10 months ago
Robust solutions for combinatorial auctions
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...
Alan Holland, Barry O'Sullivan
GECON
2007
Springer
117views Business» more  GECON 2007»
13 years 11 months ago
DFCA: A Flexible Refundable Auction for Limited Capacity Suppliers
This paper proposes a novel auction-based mechanisms named Decreasing Cancellation Fee Auction (DCFA) for task allocation in the environment where a service provider has finite ca...
Zhixing Huang, Shigeo Matsubara