3 papers
cs.GT2026
Constrained Fair Allocations via Partition Matroid Reductions
Benjamin Cookson, Nisarg Shah
We study fair allocation of indivisible goods under additive valuations and matroid constraints. A challenging open question is whether a complete and feasible envy-free up to one…
cs.GT2026
Fair Division Under Boolean Valuations: Beyond Normalization
Nisarg Shah, Paritosh Verma
We study fair division of indivisible items when agents have arbitrary two-level preferences: the value of each agent for any set of items is Boolean, which need not be monotone or…
cs.GT2026
The Art of Calling the Winner by Asking Just Enough Questions: Competitive Preference Elicitation with Next-Best Queries
Nisarg Shah, Ziqi Yu
We study active elicitation of agent preferences for collectively choosing among alternatives using prominent voting rules. We focus on the next-best query model, in which an a…