Showing 2024Show all
3 papers · 1 filter
cs.GT2024
Connected Equitable Cake Division via Sperner's Lemma
Umang Bhaskar, A. R. Sricharan, Rohit Vaish
We study the problem of fair cake-cutting where each agent receives a connected piece of the cake. A division of the cake is deemed fair if it is equitable, which means that all ag…
cs.GT2024
Approximating One-Sided and Two-Sided Nash Social Welfare With Capacities
Salil Gokhale, Harshul Sagar, Rohit Vaish +2
We study the problem of maximizing Nash social welfare, which is the geometric mean of agents' utilities, in two well-known models. The first model involves one-sided preferences,…
cs.GT2024
Capacity Modification in the Stable Matching Problem
Salil Gokhale, Shivika Narang, Samarth Singla +1
We study the problem of capacity modification in the many-to-one stable matching of workers and firms. Our goal is to systematically study how the set of stable matchings changes w…