41 citations · 300 across the 36 of their papers we have counts for
37 papers
Envy-Free Chore Allocation with Unit Subsidies under Negative Dichotomous Valuations
Mainak Sarkar, Soumyarup Sadhukhan
We study the allocation of indivisible chores with subsidies under negative dichotomous valuations, where the marginal disutility of every chore is either zero or one. This is the…
Strategy-Proof Probabilistic Social Choice Correspondences under Conditional Expected Utility
Madhuparna Karmokar, Ujjwal Kumar, Soumyarup Sadhukhan
We study unanimous and strategy-proof probabilistic social choice correspondences (PSCCs), where the selected set of alternatives is interpreted as an interim outcome, and agents e…
A characterization of strategy-proof probabilistic assignment rules
Sai Praneeth Donthu, Souvik Roy, Soumyarup Sadhukhan +1
We study the classical probabilistic assignment problem, where finitely many indivisible objects are to be probabilistically or proportionally assigned among an equal number of age…
The Game of Graph Nim on graphs with four edges
Sayar Karmakar, Moumanti Podder, Souvik Roy +1
This work is concerned with the study of the Game of Graph Nim -- a class of two-player combinatorial games -- on graphs with edges. To each edge of such a graph is assigned a…
Neutrino fog in the light dark sector: the role of isospin violation
Víctor Martín Lozano, Shankar Pramanik, Soumya Sadhukhan +1
Dark matter (DM) direct detection is now standing at an interesting juncture, where the Standard Model (SM) neutrino background and the upper bound on the DM signal cross section a…
On Probabilistic Assignment Rules
Sreedurga Gogulapati, Yadati Narahari, Souvik Roy +1
We study the classical assignment problem with initial endowments in a probabilistic framework. In this setting, each agent initially owns an object and has strict preferences over…