5 citations · 8 across the 2 of their papers we have counts for
2 papers
cs.GT2017★ 3 cited
Learning in the Repeated Secretary Problem
Daniel G. Goldstein, R. Preston McAfee, Siddharth Suri +1
In the classical secretary problem, one attempts to find the maximum of an unknown and unlearnable distribution through sequential search. In many real-world searches, however, dis…
cs.GT2014★ 5 cited
Position Auctions with Externalities and Brand Effects
Patrick Hummel, R. Preston McAfee
This paper presents models for predicted click-through rates in position auctions that take into account two possibilities that are not normally considered---that the identities of…