1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.GT2023
Greedy-Based Online Fair Allocation with Adversarial Input: Enabling Best-of-Many-Worlds Guarantees
Zongjun Yang, Luofeng Liao, Christian Kroer
We study an online allocation problem with sequentially arriving items and adversarially chosen agent values, with the goal of balancing fairness and efficiency. Our goal is to stu…
cs.GT2023★ 1 cited
Learning to Bid in Repeated First-Price Auctions with Budgets
Qian Wang, Zongjun Yang, Xiaotie Deng +1
Budget management strategies in repeated auctions have received growing attention in online advertising markets. However, previous work on budget management in online bidding mainl…