4 citations · 33 across the 44 of their papers we have counts for
6 papers · 1 filter
Pricing Query Complexity of Revenue Maximization
Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng +1
The common way to optimize auction and pricing systems is to set aside a small fraction of the traffic to run experiments. This leads to the question: how can we learn the most wit…
Approximately Efficient Bilateral Trade
Yuan Deng, Jieming Mao, Balasubramanian Sivan +1
We study bilateral trade between two strategic agents. The celebrated result of Myerson and Satterthwaite states that in general, no incentive-compatible, individually rational and…
Online Bipartite Matching with Reusable Resources
Steven Delong, Alireza Farhadi, Rad Niazadeh +2
We study the classic online bipartite matching problem with a twist: offline vertices, called resources, are . In particular, when a resource is matched to an on…
Online Allocation and Display Ads Optimization with Surplus Supply
Melika Abolhassani, Hossein Esfandiari, Yasamin Nazari +3
In this work, we study a scenario where a publisher seeks to maximize its total revenue across two sales channels: guaranteed contracts that promise to deliver a certain number of…
Learning to Price Against a Moving Target
Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng +1
In the Learning to Price setting, a seller posts prices over time with the goal of maximizing revenue while learning the buyer's valuation. This problem is very well understood whe…
Optimal Pricing Schemes for an Impatient Buyer
Yuan Deng, Jieming Mao, Balasubramanian Sivan +1
A patient seller aims to sell a good to an impatient buyer (i.e., one who discounts utility over time). The buyer will remain in the market for a period of time , and her privat…