most citedFair Chore Division under Binary Supermodular Costs

1 citations · 1 across the 5 of their papers we have counts for

collaborators

5 papers

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.GT20231 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…

gr-qc2022

Constraining Brans-Dicke Parameter Using Gravitational Radiation

Paritosh Verma

This article presents a theoretical limit on the Brans-Dicke (BD) parameter using a neutron star (NS) revolving around a galactic central engine.The assumption that the orbital rad…