1 citations · 1 across the 9 of their papers we have counts for
9 papers
Asymmetric Trading Prophets
Gagan Aggarwal, Anupam Gupta, Yifan Wang +1
The "Trading Prophet" problem challenges an online trader to maximize its profit by buying and selling assets under stochastic prices and capacity constraints, competing against an…
Learning Anonymous Pricing for Online Resource Allocation
Yifeng Teng, Yifan Wang
We study the online resource allocation problem, where a seller sequentially receives independent requests for types of resources with limited supplies from heterogeneous a…
Online Advertising with Spatial Interactions
Gagan Aggarwal, Yifan Wang, Mingfei Zhao
Online advertising platforms must decide how to allocate multiple ads across limited screen real estate, where each ad's effectiveness depends not only on its own placement but als…
Pricing Query Complexity of Multiplicative Revenue Approximation
Wei Tang, Yifan Wang, Mengxiao Zhang
We study the pricing query complexity of revenue maximization for a single buyer whose private valuation is drawn from an unknown distribution. In this setting, the seller must lea…
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…
Bandit Sequential Posted Pricing via Half-Concavity
Sahil Singla, Yifan Wang
Sequential posted pricing auctions are popular because of their simplicity in practice and their tractability in theory. A usual assumption in their study is that the Bayesian prio…