Pareto optimal matchings of students to courses in the presence of prerequisites

DOI10.1016/j.disopt.2018.04.004zbMath1506.91116arXiv1603.00858OpenAlexW2290645672WikidataQ129453793 ScholiaQ129453793MaRDI QIDQ1662656

Bettina Klaus, David F. Manlove, Katarína Cechlárova

Publication date: 20 August 2018

Published in: Discrete Optimization (Search for Journal in Brave)

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

zbMATH Keywords

Pareto optimalityNP-hardnesssequential mechanismcourse allocationprerequisites

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Matching models (91B68)

Cites Work

• Unnamed Item
• Pareto optimal matchings in many-to-many markets with ties
• The college admissions problem is not equivalent to the marriage problem
• Some simplified NP-complete graph problems
• A tale of two mechanisms: Student placement
• Queue allocation of indivisible goods
• Strategy-proofness, solidarity, and consistency for multiple assignment problems
• Pareto optimality in many-to-many matching problems
• Matching with quorums
• A note on object allocation under lexicographic preferences
• Serial dictatorship and Pareto optimality
• Job Matching, Coalition Formation, and Gross Substitutes
• Axioms for Lexicographic Preferences
• Complexity of Scheduling under Precedence Constraints
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• Reducibility among Combinatorial Problems
• A Class of Sequential Games
• Algorithms and Computation
• Matching with sizes (or scheduling with processing set restrictions)

This page was built for publication: Pareto optimal matchings of students to courses in the presence of prerequisites