3 papers
cs.LG2025
A New Benchmark for Online Learning with Budget-Balancing Constraints
Mark Braverman, Jingyi Liu, Jieming Mao +2
The adversarial Bandit with Knapsack problem is a multi-armed bandits problem with budget constraints and adversarial rewards and costs. In each round, a learner selects an action…
cs.GT2024
Toward Fair and Strategyproof Tournament Rules for Tournaments with Partially Transferable Utilities
David Pennock, Ariel Schvartzman, Eric Xue
A tournament on agents is a complete oriented graph with the agents as vertices and edges that describe the win-loss outcomes of the matches played between each…
cs.GT2024
Settling the Competition Complexity of Additive Buyers over Independent Items
Mahsa Derakhshan, Emily Ryu, S. Matthew Weinberg +1
The competition complexity of an auction setting is the number of additional bidders needed such that the simple mechanism of selling items separately (with additional bidders) ach…