Sciweavers

20 search results - page 4 / 4
» Shared Winner Determination in Sponsored Search Auctions
Sort
View
IJCAI
2001
13 years 9 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...
ATAL
2010
Springer
13 years 9 months ago
Finding approximate competitive equilibria: efficient and fair course allocation
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
Abraham Othman, Tuomas Sandholm, Eric Budish
WWW
2009
ACM
14 years 9 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...
ITNG
2006
IEEE
14 years 2 months ago
Overlap Among Major Web Search Engines
Purpose – This paper reports the findings of a major study examining the overlap among results retrieved by three major web search engines. The goal of the research was to: mea...
Amanda Spink, Bernard J. Jansen, Chris Blakely, Sh...
ICN
2007
Springer
14 years 2 months ago
Active Peer to Peer
—Peer to peer is an important way for files sharing. In existing P2P systems, users need to query and retrieve files, and have to know some knowledge, such as file names, keyword...
Xuelian Lin, Jinpeng Huai, Xudong Liu, Jun Han