3 papers
cs.GT2026
Stronger core results with multidimensional prices
Mark Braverman, Jingyi Liu, Eric Xue +1
We study one-sided matchings with endowments in the absence of money. It is well-known that a competitive equilibrium may not always exist and that the strong core may be empty in…
cs.CC2025
An Invariance Principle for the Multi-slice, with Applications
Mark Braverman, Subhash Khot, Noam Lifshitz +1
Given an alphabet size thought of as a constant, and whose entries sum of up , the -multi-slice is the set of vectors $x\i…
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…