activity
20202026
most citedExistence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations

12 citations · 20 across the 17 of their papers we have counts for

collaborators
Showing 2023Show all

5 papers · 1 filter

cs.GT2023

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…

cs.GT2023

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,…

cs.GT2023

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…

cs.GT2023★ 1 cited

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…

cs.AI2023

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…