Sciweavers

243 search results - page 19 / 49
» On Optimal Single-Item Auctions
Sort
View
SIGECOM
2004
ACM
112views ECommerce» more  SIGECOM 2004»
14 years 25 days 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
ICS
2010
Tsinghua U.
13 years 9 months ago
The auction: optimizing banks usage in Non-Uniform Cache Architectures
The growing influence of wire delay in cache design has meant that access latencies to last-level cache banks are no longer constant. Non-Uniform Cache Architectures (NUCAs) have ...
Javier Lira, Carlos Molina, Antonio Gonzále...
WWW
2009
ACM
14 years 8 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
CEC
2008
IEEE
14 years 1 months ago
Differential evolution for discrete optimization: An experimental study on Combinatorial Auction problems
: Differential evolutionary (DE) mutates solution vectors by the weighted difference of other vectors using arithmetic operations. As these operations cannot be directly extended t...
Jingqiao Zhang, Viswanath Avasarala, Arthur C. San...
IJCAI
2001
13 years 8 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...