3 papers
cs.GT2026
Approximate Envy-Freeness and Pareto Optimality Beyond Additivity
Harish Chandramouleeswaran, Prajakta Nimbhorkar
We study the compatibility of envy-freeness up to one good (EF1) and Pareto optimality (PO) beyond additive valuations. For two agents with monotone submodular valuations, we prove…
cs.DS2025
Testing forbidden order-pattern properties on hypergrids
Harish Chandramouleeswaran, Ilan Newman, Tomer Pelleg +1
We study testing -freeness of functions , where is -free if there there are no indices such that $f(x_i)<f(x_…
cs.GT2024
Fair Division in a Variable Setting
Harish Chandramouleeswaran, Prajakta Nimbhorkar, Nidhi Rathi
We study fair division of indivisible items under a variable input setting, where the set of agents or items may change over time. Starting from an arbitrary allocation, the goal i…