Sciweavers

139 search results - page 1 / 28
» AdWords and generalized online matching
Sort
View
76
Voted
FOCS
2005
IEEE
15 years 3 months ago
AdWords and Generalized On-line Matching
How does a search engine company decide what ads to display with each query so as to maximize its revenue? This turns out to be a generalization of the online bipartite matching p...
Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vij...
JACM
2007
93views more  JACM 2007»
14 years 10 months ago
AdWords and generalized online matching
Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vij...
92
Voted
CORR
2010
Springer
94views Education» more  CORR 2010»
14 years 8 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
IPL
2008
79views more  IPL 2008»
14 years 10 months ago
Ski rental with two general options
We define and solve a simple extension of the ski-rental problem [4]. In the classical version, the algorithm needs to decide when to switch from renting to buying. In our version...
Zvi Lotker, Boaz Patt-Shamir, Dror Rawitz
98
Voted
CCS
2010
ACM
14 years 10 months ago
User-friendly matching protocol for online social networks
In this paper, we outline a privacy-preserving matching protocol for OSN (online social network) users to find their potential friends. With the proposed protocol, a logged-in use...
Qiang Tang