On reachable assignments in cycles

DOI10.1007/978-3-030-87756-9_18OpenAlexW3210319260MaRDI QIDQ2695447

Matthias Bentert, Luis Müller

Publication date: 31 March 2023

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

zbMATH Keywords

resource allocationpolynomial-time algorithmmulti-agent systemsreduction to 2-SAT

Mathematics Subject Classification ID

Decision theory (91B06) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Social choice (91B14) Matching models (91B68)

Related Items (1)

On reachable assignments under dichotomous preferences

Cites Work

• Unnamed Item
• Incentive compatibility in a market with indivisible goods
• On the convergence of swap dynamics to Pareto-optimal matchings
• The three-state perfect phylogeny problem reduces to 2-SAT
• House allocation with existing tenants: a characterization
• Constrained swap dynamics over a social network in distributed resource reallocation
• On cores and indivisibility
• Computing the Deficiency of Housing Markets with Duplicate Houses
• Algorithms and Computation

This page was built for publication: On reachable assignments in cycles