5 papers
Generalized percolation games on the -dimensional square lattice, and ergodicity of associated probabilistic cellular automata
Dhruv Bhasin, Sayar Karmakar, Moumanti Podder +1
Each vertex of the infinite -dimensional square lattice graph is assigned, independently, a label that reads trap with probability , target with probability , and open wit…
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…
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…
Percolation games on rooted, edge-weighted random trees
Sayar Karmakar, Moumanti Podder, Souvik Roy +1
Consider a rooted Galton-Watson tree , to each of whose edges we assign, independently, a weight that equals with probability , with probability and …