activity
20232026
most citedOn Supermodular Contracts and Dense Subgraphs

1 citations · 1 across the 5 of their papers we have counts for

collaborators

5 papers

cs.GT2026

Improved Multi-Dimensional Forecasting for Swap Regret

Joey Rivkin, Ramiro N. Deo-Campo Vuong, Robert Kleinberg +3

We study the problem of forecasting for an arbitrary number of downstream agents with unknown objectives, each of whom best responds to the forecaster's predictions. We seek a sing…

cs.DS2026

Water-Filling is Universally Minimax Optimal

Siddhartha Banerjee, Ramiro N. Deo-Campo Vuong, Robert Kleinberg

Allocation of dynamically-arriving (i.e., online) divisible resources among a set of offline agents is a fundamental problem, with applications to online marketplaces, scheduling,…

cs.GT2025

The Keychain Problem: On Minimizing the Opportunity Cost of Uncertainty

Ramiro N. Deo-Campo Vuong, Robert Kleinberg, Aditya Prasad +2

In this paper, we introduce a family of sequential decision-making problems, collectively termed the Keychain Problem, that involve exploring a set of actions to maximize expected…

cs.LG2024

No-Regret Learning for Fair Multi-Agent Social Welfare Optimization

Mengxiao Zhang, Ramiro Deo-Campo Vuong, Haipeng Luo

We consider the problem of online multi-agent Nash social welfare (NSW) maximization. While previous works of Hossain et al. [2021], Jones et al. [2023] study similar problems in s…

cs.GT2023★ 1 cited

On Supermodular Contracts and Dense Subgraphs

Ramiro Deo-Campo Vuong, Shaddin Dughmi, Neel Patel +1

We study the combinatorial contract design problem, introduced and studied by Dutting et. al. (2021, 2022), in both the single and multi-agent settings. Prior work has examined the…