4 papers
Learning Optimal Posted Prices for a Unit-Demand Buyer
Yifeng Teng, Yifan Wang
We study the problem of learning the optimal item pricing for a unit-demand buyer with independent item values, and the learner has query access to the buyer's value distributions.…
Multi-Unit Combinatorial Prophet Inequalities
Shuchi Chawla, Trung Dang, Zhiyi Huang +1
We consider a combinatorial auction setting where buyers have fractionally subadditive (XOS) valuations over the items and the seller's objective is to maximize the social welfare.…
Single-Sample and Robust Online Resource Allocation
Rohan Ghuge, Sahil Singla, Yifan Wang
Online Resource Allocation problem is a central problem in many areas of Computer Science, Operations Research, and Economics. In this problem, we sequentially receive stochast…
Online Stochastic Matching with Unknown Arrival Order: Beating against the Online Optimum
Enze Sun, Zhihao Gavin Tang, Yifan Wang
We study the online stochastic matching problem. Against the offline benchmark, Feldman, Gravin, and Lucier (SODA 2015) designed an optimal -competitive algorithm. A recent li…