Sciweavers

20 search results - page 1 / 4
» Auction Design with Avoidable Fixed Costs: An Experimental A...
Sort
View
DAGSTUHL
2007
13 years 6 months ago
Auction Design with Avoidable Fixed Costs: An Experimental Approach
Advances in information technology and computational power have opened the doors for auctioneers to explore a range of auction formats by considering varying degrees of bid expres...
Wedad Elmaghraby, Nathan Larson
AMAI
2005
Springer
13 years 4 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
AAAI
2011
12 years 4 months ago
Incentive-Compatible Escrow Mechanisms
The most prominent way to establish trust between buyers and sellers on online auction sites are reputation mechanisms. Two drawbacks of this approach are the reliance on the sell...
Jens Witkowski, Sven Seuken, David C. Parkes
AMEC
2003
Springer
13 years 10 months ago
Choosing Samples to Compute Heuristic-Strategy Nash Equilibrium
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
William E. Walsh, David C. Parkes, Rajarshi Das
ER
2001
Springer
136views Database» more  ER 2001»
13 years 9 months ago
A Randomized Approach for the Incremental Design of an Evolving Data Warehouse
A Data Warehouse (DW) can be used to integrate data from multiple distributed data sources. A DW can be seen as a set of materialized views that determine its schema and its conten...
Dimitri Theodoratos, Theodore Dalamagas, Alkis Sim...