Sciweavers

197 search results - page 33 / 40
» Bidding and allocation in combinatorial auctions
Sort
View
ATAL
2003
Springer
15 years 3 months ago
Miscomputing ratio: social cost of selfish computing
Auctions are useful mechanism for allocating items (goods, tasks, resources, etc.) in multiagent systems. The bulk of auction theory assumes that the bidders’ valuations for ite...
Kate Larson, Tuomas Sandholm
WWW
2010
ACM
15 years 5 months ago
Expressive auctions for externalities in online advertising
When online ads are shown together, they compete for user attention and conversions, imposing negative externalities on each other. While the competition for user attention in spo...
Arpita Ghosh, Amin Sayedi
SIGECOM
2009
ACM
83views ECommerce» more  SIGECOM 2009»
15 years 4 months ago
The price of truthfulness for pay-per-click auctions
We analyze the problem of designing a truthful pay-per-click auction where the click-through-rates (CTR) of the bidders are unknown to the auction. Such an auction faces the class...
Nikhil R. Devanur, Sham M. Kakade
COCOON
2005
Springer
15 years 3 months ago
Interval Subset Sum and Uniform-Price Auction Clearing
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...
Anshul Kothari, Subhash Suri, Yunhong Zhou
AAIM
2009
Springer
123views Algorithms» more  AAIM 2009»
15 years 4 months ago
Efficiently Generating k-Best Solutions to Procurement Auctions
: © Efficiently Generating k-Best Solutions to Procurement Auctions Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan HP Laboratories HPL-2009-163 procurement, auctions, dec...
Andrew Byde, Terence Kelly, Yunhong Zhou, Robert E...