On reachable assignments under dichotomous preferences

DOI10.1016/j.tcs.2023.114196arXiv2209.10262MaRDI QIDQ6057838

Yusuke Kobayashi, Yuta Nozaki, Kenta Ozeki, Naonori Kakimura, Naoyuki Kamiyama, Yoshio Okamoto, Takehiro Ito

Publication date: 26 October 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.10262

zbMATH Keywords

combinatorial reconfigurationdichotomous preferenceitem assignmentitem exchange

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• On the complexity of reconfiguration problems
• House allocation with existing tenants
• On cores and indivisibility
• Envy-free allocations respecting social networks
• On social envy-freeness in multi-unit markets
• Introduction to reconfiguration
• On fairness via picking sequences in allocation of indivisible goods
• On reachable assignments in cycles
• Discrete Convex Analysis
• Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling
• The Perfect Matching Reconfiguration Problem
• Algorithmics of Matching Under Preferences
• Random Matching Under Dichotomous Preferences
• Unnamed Item

This page was built for publication: On reachable assignments under dichotomous preferences