Siddharth Barman
YOU?
Author Swipe
View article: Introspectively Envy-Free and Efficient Allocation of Indivisible Mixed Manna
Introspectively Envy-Free and Efficient Allocation of Indivisible Mixed Manna Open
The existence of allocations that are fair and efficient, simultaneously, is a central inquiry in fair division literature. A prominent result in discrete fair division shows that the complementary desiderata of fairness and efficiency can…
View article: Fair and Efficient Allocation of Indivisible Mixed Manna
Fair and Efficient Allocation of Indivisible Mixed Manna Open
We study fair division of indivisible mixed manna (items whose values may be positive, negative, or zero) among agents with additive valuations. Here, we establish that fairness -- in terms of a relaxation of envy-freeness -- and Pareto ef…
View article: Fair Division with Market Values
Fair Division with Market Values Open
We introduce a model of fair division with market values, where indivisible goods must be partitioned among agents with (additive) subjective valuations, and each good additionally has a market value. The market valuation can be viewed as …
View article: Exact Maximin Share Fairness via Adjusted Supply
Exact Maximin Share Fairness via Adjusted Supply Open
This work addresses fair allocation of indivisible items in settings wherein it is feasible to create copies of resources or dispose of tasks. We establish that exact maximin share (MMS) fairness can be achieved via limited duplication of …
View article: Fair Division Beyond Monotone Valuations
Fair Division Beyond Monotone Valuations Open
This paper studies fair division of divisible and indivisible items among agents whose cardinal preferences are not necessarily monotone. We establish the existence of fair divisions and develop approximation algorithms to compute them. We…
View article: Fair Division with Market Values
Fair Division with Market Values Open
We introduce a model of fair division with market values, where indivisible goods must be partitioned among agents with (additive) subjective valuations, and each good additionally has a market value. The market valuation can be viewed as …
View article: Compatibility of Fairness and Nash Welfare under Subadditive Valuations
Compatibility of Fairness and Nash Welfare under Subadditive Valuations Open
We establish a compatibility between fairness and efficiency, captured via Nash Social Welfare (NSW), under the broad class of subadditive valuations. We prove that, for subadditive valuations, there always exists a partial allocation that…
View article: Causal Contextual Bandits with Adaptive Context
Causal Contextual Bandits with Adaptive Context Open
We study a variant of causal contextual bandits where the context is chosen based on an initial intervention chosen by the learner. At the beginning of each round, the learner selects an initial action, depending on which a stochastic cont…
View article: Generalized Linear Bandits with Limited Adaptivity
Generalized Linear Bandits with Limited Adaptivity Open
We study the generalized linear contextual bandit problem within the constraints of limited adaptivity. In this paper, we present two algorithms, $\texttt{B-GLinCB}$ and $\texttt{RS-GLinCB}$, that address, respectively, two prevalent limit…
View article: Nearly Equitable Allocations beyond Additivity and Monotonicity
Nearly Equitable Allocations beyond Additivity and Monotonicity Open
Equitability (EQ) in fair division requires that items be allocated such that all agents value the bundle they receive equally. With indivisible items, an equitable allocation may not exist, and hence we instead consider a meaningful analo…
View article: Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations
Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations Open
We study the problem of allocating indivisible goods among n agents with the objective of maximizing Nash social welfare (NSW). This welfare function is defined as the geometric mean of the agents' valuations and, hence, it strikes a balan…
View article: A tale of two metrics: simultaneous bounds on competitiveness and regret
A tale of two metrics: simultaneous bounds on competitiveness and regret Open
We consider algorithms for 'smoothed online convex optimization' (SOCO) problems, which are a hybrid between online convex optimization (OCO) and metrical task system (MTS) problems. Historically, the performance metric for OCO was regret …
View article: Parameterized Guarantees for Almost Envy-Free Allocations
Parameterized Guarantees for Almost Envy-Free Allocations Open
We study fair allocation of indivisible goods among agents with additive valuations. We obtain novel approximation guarantees for three of the strongest fairness notions in discrete fair division, namely envy-free up to the removal of any …
View article: Nearly Equitable Allocations Beyond Additivity and Monotonicity
Nearly Equitable Allocations Beyond Additivity and Monotonicity Open
Equitability (EQ) in fair division requires that items be allocated such that all agents value the bundle they receive equally. With indivisible items, an equitable allocation may not exist, and hence we instead consider a meaningful analo…
View article: Nash Regret Guarantees for Linear Bandits
Nash Regret Guarantees for Linear Bandits Open
We obtain essentially tight upper bounds for a strengthened notion of regret in the stochastic linear bandits framework. The strengthening -- referred to as Nash regret -- is defined as the difference between the (a priori unknown) optimum…
View article: Fairness and Welfare Quantification for Regret in Multi-Armed Bandits
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits Open
We extend the notion of regret with a welfarist perspective. Focussing on the classic multi-armed bandit (MAB) framework, the current work quantifies the performance of bandit algorithms by applying a fundamental welfare function, namely t…
View article: Finding Fair Allocations under Budget Constraints
Finding Fair Allocations under Budget Constraints Open
We study the fair allocation of indivisible goods among agents with identical, additive valuations but individual budget constraints. Here, the indivisible goods--each with a specific size and value--need to be allocated such that the bund…
View article: Learning Good Interventions in Causal Graphs via Covering
Learning Good Interventions in Causal Graphs via Covering Open
We study the causal bandit problem that entails identifying a near-optimal intervention from a specified set $A$ of (possibly non-atomic) interventions over a given causal graph. Here, an optimal intervention in ${A}$ is one that maximizes…
View article: Guaranteeing Envy-Freeness under Generalized Assignment Constraints
Guaranteeing Envy-Freeness under Generalized Assignment Constraints Open
We study fair division of goods under the broad class of generalized assignment constraints. In this constraint framework, the sizes and values of the goods are agent-specific, and one needs to allocate the goods among the agents fairly wh…
View article: Fair Chore Division under Binary Supermodular Costs
Fair Chore Division under Binary Supermodular Costs Open
We study the problem of dividing indivisible chores among agents whose costs (for the chores) are supermodular set functions with binary marginals. Such functions capture complementarity among chores, i.e., they constitute an expressive cl…
View article: Approximation Algorithms for Envy-Free Cake Division with Connected Pieces
Approximation Algorithms for Envy-Free Cake Division with Connected Pieces Open
Cake cutting is a classic model for studying fair division of a heterogeneous, divisible resource among agents with individual preferences. Addressing cake division under a typical requirement that each agent must receive a connected piece…
View article: Finding Fair Allocations under Budget Constraints
Finding Fair Allocations under Budget Constraints Open
We study the fair allocation of indivisible goods among agents with identical, additive valuations but individual budget constraints. Here, the indivisible goods--each with a specific size and value--need to be allocated such that the bund…
View article: Nash Welfare Guarantees for Fair and Efficient Coverage
Nash Welfare Guarantees for Fair and Efficient Coverage Open
We study coverage problems in which, for a set of agents and a given threshold $T$, the goal is to select $T$ subsets (of the agents) that, while satisfying combinatorial constraints, achieve fair and efficient coverage among the agents. I…
View article: Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations
Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations Open
We study the problem of allocating indivisible goods among agents in a fair manner. While envy-free allocations of indivisible goods are not guaranteed to exist, envy-freeness can be achieved by additionally providing some subsidy to the a…
View article: Truthful and Fair Mechanisms for Matroid-Rank Valuations
Truthful and Fair Mechanisms for Matroid-Rank Valuations Open
We study the problem of allocating indivisible goods among strategic agents. We focus on settings wherein monetary transfers are not available and each agent's private valuation is a submodular function with binary marginals, i.e., the age…
View article: Universal and Tight Online Algorithms for Generalized-Mean Welfare
Universal and Tight Online Algorithms for Generalized-Mean Welfare Open
We study fair and efficient allocation of divisible goods, in an online manner, among n agents. The goods arrive online in a sequence of T time periods. The agents' values for a good are revealed only after its arrival, and the online algo…
View article: Fairness and Welfare Quantification for Regret in Multi-Armed Bandits
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits Open
We extend the notion of regret with a welfarist perspective. Focussing on the classic multi-armed bandit (MAB) framework, the current work quantifies the performance of bandit algorithms by applying a fundamental welfare function, namely t…
View article: The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies
The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies Open
We revisit the connection between bargaining and equilibrium in exchange economies and study its algorithmic implications. We consider bargaining outcomes to be allocations that cannot be blocked (i.e., profitably retraded) by coalitions o…
View article: Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations
Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations Open
We study the problem of allocating indivisible goods among agents in a fair manner. While envy-free allocations of indivisible goods are not guaranteed to exist, envy-freeness can be achieved by additionally providing some subsidy to the a…
View article: Approximating Nash Social Welfare Under Binary XOS and Binary Subadditive Valuations
Approximating Nash Social Welfare Under Binary XOS and Binary Subadditive Valuations Open