7k citations
- University of California, Santa BarbaraUS109 papers
- Microsoft Research (United Kingdom)GB51 papers
- ETH ZurichCH48 papers
- University of California, BerkeleyUS45 papers
- University of Maryland, College ParkUS44 papers
- Carnegie Mellon UniversityUS42 papers
- Stanford UniversityUS39 papers
- University of WashingtonUS38 papers
- Cornell UniversityUS33 papers
- Princeton UniversityUS32 papers
- California Institute of TechnologyUS28 papers
- Microsoft Research New York City (United States)25 papers
29 papers · 1 filter
Fair Decisions through Plurality: Results from a Crowdfunding Platform
Joel Miller, E. Glen Weyl, Chris Kanich
We discuss an algorithmic intervention aimed at increasing equity and economic efficiency at a crowdfunding platform that gives cash subsidies to grantees. Through a blend of techn…
Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions
Mahsa Derakhshan, David M. Pennock, Aleksandrs Slivkins
We study the problem of finding personalized reserve prices for unit-demand buyers in multi-unit eager VCG auctions with correlated buyers. The input to this problem is a dataset o…
Equitable Allocations of Indivisible Chores
Rupert Freeman, Sujoy Sikdar, Rohit Vaish +1
We study fair allocation of indivisible chores (i.e., items with non-positive value) among agents with additive valuations. An allocation is deemed fair if it is (approximately) eq…
Bayesian Exploration with Heterogeneous Agents
Nicole Immorlica, Jieming Mao, Aleksandrs Slivkins +1
It is common in recommendation systems that users both consume and produce information as they make strategic choices under uncertainty. While a social planner would balance "explo…
The Perils of Exploration under Competition: A Computational Modeling Approach
Guy Aridor, Kevin Liu, Aleksandrs Slivkins +1
We empirically study the interplay between exploration and competition. Systems that learn from interactions with users often engage in exploration: making potentially suboptimal d…
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…