Sciweavers

43 search results - page 8 / 9
» Private Auctions with Multiple Rounds and Multiple Items
Sort
View
SIGECOM
2010
ACM
156views ECommerce» more  SIGECOM 2010»
14 years 5 days ago
Robust mechanisms for risk-averse sellers
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
Mukund Sundararajan, Qiqi Yan
ATAL
2010
Springer
13 years 8 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
FLAIRS
2006
13 years 8 months ago
Efficient Bids on Task Allocation for Multi-Robot Exploration
We propose a real time single item auction based task allocation method for the multi-robot exploration problem and investigate new bid evaluation strategies in this domain. In th...
Sanem Sariel, Tucker R. Balch
ATAL
2011
Springer
12 years 7 months ago
A study of computational and human strategies in revelation games
Revelation games are bilateral bargaining games in which agents may choose to truthfully reveal their private information before engaging in multiple rounds of negotiation. They a...
Noam Peled, Ya'akov (Kobi) Gal, Sarit Kraus
STOC
2010
ACM
194views Algorithms» more  STOC 2010»
14 years 6 days ago
Multi-parameter mechanism design and sequential posted pricing
We study the classic mathematical economics problem of Bayesian optimal mechanism design where a principal aims to optimize expected revenue when allocating resources to self-inte...
Shuchi Chawla, Jason Hartline, David Malec and Bal...