activity
20052014
most citedOnline Stochastic Matching: Beating 1-1/e

40 citations · 129 across the 13 of their papers we have counts for

collaborators

13 papers

cs.DS2014

Multiplicative Bidding in Online Advertising

MohammadHossein Bateni, Jon Feldman, Vahab Mirrokni +1

In this paper, we initiate the study of the multiplicative bidding language adopted by major Internet search companies. In multiplicative bidding, the effective bid on a particular…

math.OC2011

Yield Optimization of Display Advertising with Ad Exchange

Santiago Balseiro, Jon Feldman, Vahab Mirrokni +1

In light of the growing market of Ad Exchanges for the real-time sale of advertising slots, publishers face new challenges in choosing between the allocation of contract-based rese…

cs.DS2010★ 39 cited

Online Stochastic Packing Applied to Display Ad Allocation

Jon Feldman, Monika Henzinger, Nitish Korula +2

Inspired by online ad allocation, we study online stochastic packing linear programs from theoretical and practical standpoints. We first present a near-optimal online algorithm fo…

cs.DS2009★ 40 cited

Online Stochastic Matching: Beating 1-1/e

Jon Feldman, Aranyak Mehta, Vahab Mirrokni +1

We study the online stochastic bipartite matching problem, in a form motivated by display ad allocation on the Internet. In the online, but adversarial case, the celebrated result…

cs.GT2008

Algorithmic Methods for Sponsored Search Advertising

Jon Feldman, S. Muthukrishnan

Modern commercial Internet search engines display advertisements along side the search results in response to user queries. Such sponsored search relies on market mechanisms to eli…

cs.GT2008★ 16 cited

Online Ad Slotting With Cancellations

Florin Constantin, Jon Feldman, S. Muthukrishnan +1

Many advertisers buy advertisements (ads) on the Internet or on traditional media and seek simple, online mechanisms to reserve ad slots in advance. Media publishers represent a va…