12 citations · 20 across the 17 of their papers we have counts for
18 papers
Fair Division Under Boolean Valuations: Beyond Normalization
Nisarg Shah, Paritosh Verma
We study fair division of indivisible items when agents have arbitrary two-level preferences: the value of each agent for any set of items is Boolean, which need not be monotone or…
Fair and Efficient Balanced Allocations for Additive Valuations
Benjamin Cookson, Nisarg Shah, Paritosh Verma
We study the existence of fair and efficient allocations of indivisible goods under the balancedness constraint, which requires that any two agents' bundles differ in size by at mo…
Fair Division Under Inaccurate Preferences
Trung Dang, Daniel Halpern, Anuran Makur +3
The fair allocation of scarce resources is a central problem in mathematics, computer science, operations research, and economics. While much of the fair-division literature assume…
Introspectively Envy-Free and Efficient Allocation of Indivisible Mixed Manna
Siddharth Barman, Paritosh Verma
The existence of allocations that are simultaneously fair and efficient is a central inquiry in fair division. Prominent results show that these complementary desiderata can be ach…
Online Envy Minimization and Multicolor Discrepancy: Equivalences and Separations
Daniel Halpern, Alexandros Psomas, Paritosh Verma +1
We consider the fundamental problem of allocating indivisible items that arrive over time to agents with additive preferences, with the goal of minimizing envy. This proble…
Fair Division Beyond Monotone Valuations with Applications to Equitable Graph Partitioning
Siddharth Barman, Paritosh Verma
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 divisio…
Automating Food Drop: The Power of Two Choices for Dynamic and Fair Food Allocation
Marios Mertzanidis, Alexandros Psomas, Paritosh Verma
Food waste and food insecurity are two closely related pressing global issues. Food rescue organizations worldwide run programs aimed at addressing the two problems. In this paper,…
On the Fairness of Normalized p-Means for Allocating Goods and Chores
Owen Eckart, Alexandros Psomas, Paritosh Verma
Allocating items in a fair and economically efficient manner is a central problem in fair division. We study this problem for agents with additive preferences, when items are all g…
Refined Mechanism Design for Approximately Structured Priors via Active Regression
Christos Boutsikas, Petros Drineas, Marios Mertzanidis +2
We consider the problem of a revenue-maximizing seller with a large number of items for sale to strategic bidders, whose valuations are drawn independently from high-dimens…
On the Existence of Envy-Free Allocations Beyond Additive Valuations
Gerdus Benadè, Daniel Halpern, Alexandros Psomas +1
We study the problem of fairly allocating indivisible items among agents. Envy-free allocations, in which each agent prefers her bundle to the bundle of every other agent,…
Getting More by Knowing Less: Bayesian Incentive Compatible Mechanisms for Fair Division
Vasilis Gkatzelis, Alexandros Psomas, Xizhi Tan +1
We study fair resource allocation with strategic agents. It is well-known that, across multiple fundamental problems in this domain, truthfulness and fairness are incompatible. For…
Fair Chore Division under Binary Supermodular Costs
Siddharth Barman, Vishnu V. Narayan, Paritosh Verma
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 complemen…
Decision-Focused Evaluation: Analyzing Performance of Deployed Restless Multi-Arm Bandits
Paritosh Verma, Shresth Verma, Aditya Mate +2
Restless multi-arm bandits (RMABs) is a popular decision-theoretic framework that has been used to model real-world sequential decision making problems in public health, wildlife c…
Fair and Efficient Allocations Without Obvious Manipulations
Alexandros Psomas, Paritosh Verma
We consider the fundamental problem of allocating a set of indivisible goods among strategic agents with additive valuation functions. It is well known that, in the absence of mone…
Truthful and Fair Mechanisms for Matroid-Rank Valuations
Siddharth Barman, Paritosh Verma
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…
Approximating Nash Social Welfare under Binary XOS and Binary Subadditive Valuations
Siddharth Barman, Paritosh Verma
We study the problem of allocating indivisible goods among agents in a fair and economically efficient manner. In this context, the Nash social welfare-defined as the geometric mea…
Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations
Siddharth Barman, Paritosh Verma
We study fair and economically efficient allocation of indivisible goods among agents whose valuations are rank functions of matroids. Such valuations constitute a well-studied cla…
Space Lower Bounds for Graph Stream Problems
Paritosh Verma
This work concerns with proving space lower bounds for graph problems in the streaming model. It is known that computing the length of shortest path between two nodes in the stream…