8 papers
Connected Dominating Set on Semi-Ladder-Free Graphs
Sobyasachi Chatterjee, Sushmita Gupta, Saket Saurabh +2
We study \textsc{Connected Dominating Set} on graphs whose closed-neighborhood set systems are -semi-ladder-free. This structural condition strictly generalizes the biclique-fre…
Robust Value Maximization in Challenge the Champ Tournaments with Probabilistic Outcomes
Umang Bhaskar, Juhi Chaudhary, Sushmita Gupta +2
Challenge the Champ is a simple tournament format, where an ordering of the players -- called a seeding -- is decided. The first player in this order is the initial champ, and face…
When agents choose bundles autonomously: guarantees beyond discrepancy
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman +1
We consider the fair division of indivisible items among agents with additive non-negative normalized valuations, with the goal of obtaining high value guarantees, that is, clo…
A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman +1
We present an algorithm for a class of -fold ILPs whose existing algorithms in literature are often either (1) based on the \textit{augmentation framework} where one starts with…
More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules
Sushmita Gupta, Pallavi Jain, Souvik Saha +2
Multiwinner Elections have emerged as a prominent area of research with numerous practical applications. We contribute to this area by designing parameterized approximation algorit…
When far is better: The Chamberlin-Courant approach to obnoxious committee selection
Sushmita Gupta, Tanmay Inamdar, Pallavi Jain +3
Classical work on metric space based committee selection problem interprets distance as ``near is better''. In this work, motivated by real-life situations, we interpret distance a…
Conflict and Fairness in Resource Allocation
Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta +4
In the standard model of fair allocation of resources to agents, every agent has some utility for every resource, and the goal is to assign resources to agents so that the agents'…
Budget-feasible Egalitarian Allocation of Conflicting Jobs
Sushmita Gupta, Pallavi Jain, A. Mohanapriya +1
Allocating conflicting jobs among individuals while respecting a budget constraint for each individual is an optimization problem that arises in various real-world scenarios. In th…