Algorithmics of Matching Under Preferences
From MaRDI portal
Publication:5300605
DOI10.1142/8591zbMath1283.68018OpenAlexW4213094076MaRDI QIDQ5300605
Publication date: 27 June 2013
Published in: Series on Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/8591
game theorymatchingsstable roommates problemhospitals/residents problemhouse allocation problemstability of matchingsPareto optimal matchingscapacitated house allocation problempreferences with indifferences
Programming involving graphs or networks (90C35) Algorithms in computer science (68Wxx) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Matching models (91B68)
Related Items (only showing first 100 items - show all)
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings ⋮ Maintaining Near-Popular Matchings ⋮ Pareto Optimal Matchings in Many-to-Many Markets with Ties ⋮ Modelling practical placement of trainee teachers to schools ⋮ Stable matching of student-groups to dormitories ⋮ \(d\)-dimensional stable matching with cyclic preferences ⋮ A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings ⋮ Allocation with Weak Priorities and General Constraints ⋮ On random exchange-stable matchings ⋮ On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) ⋮ Stable matchings of teachers to schools ⋮ The stable fixtures problem with payments ⋮ Fairness in Influence Maximization through Randomization ⋮ Equilibria of deferred acceptance with complete lists ⋮ A Matroid Generalization of the Super-Stable Matching Problem ⋮ Popular matchings in complete graphs ⋮ From model checking to equilibrium checking: reactive modules for rational verification ⋮ Stable matching with network externalities ⋮ Mixed-integer formulations for the capacitated rank pricing problem with envy ⋮ Finding and Recognizing Popular Coalition Structures ⋮ Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings ⋮ Profile-Based Optimal Matchings in the Student/Project Allocation Problem ⋮ The graphs of stably matchable pairs ⋮ Optimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special case ⋮ Two problems in max-size popular matchings ⋮ Complexity study for the robust stable marriage problem ⋮ Counterexamples of small size for three-sided stable matching with cyclic preferences ⋮ Solving stable matching problems using answer set programming ⋮ Stable marriage with groups of similar agents ⋮ Robust and approximately stable marriages under partial information ⋮ Improved approximation algorithms for two variants of the stable marriage problem with ties ⋮ The core of roommate problems: size and rank-fairness within matched pairs ⋮ Pareto efficient matchings with pairwise preferences ⋮ Jointly stable matchings ⋮ Fair assignment of indivisible objects under ordinal preferences ⋮ On random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferences ⋮ Friend of my friend: network formation with two-hop benefit ⋮ ``Almost-stable matchings in the hospitals/residents problem with couples ⋮ Matchings with lower quotas: algorithms and complexity ⋮ Locally Stable Marriage with Strict Preferences ⋮ Unnamed Item ⋮ Lazy Gale-Shapley for many-to-one matching with partial information ⋮ Solving hard stable matching problems involving groups of similar agents ⋮ A counterexample of size 20 for the problem of finding a 3-dimensional stable matching with cyclic preferences ⋮ Dynamics in matching and coalition formation games with structural constraints ⋮ One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences ⋮ Antimatroids induced by matchings ⋮ Handling preferences in student-project allocation ⋮ The stable roommates problem with short lists ⋮ How hard is it to satisfy (almost) all roommates ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective ⋮ Local search approaches in stable matching problems ⋮ Stable roommates problem with random preferences ⋮ Small random instances of the stable roommates problem ⋮ Mathematical models for stable matching problems with ties and incomplete lists ⋮ Strongly stable and maximum weakly stable noncrossing matchings ⋮ Study on specialist outpatient matching appointment and the balance matching model ⋮ Stable fractional matchings ⋮ The rank pricing problem with ties ⋮ Stable marriage with general preferences ⋮ Pareto optimal matchings in many-to-many markets with ties ⋮ Envy-free matchings with lower quotas ⋮ Matching with indifferences: a comparison of algorithms in the context of course allocation ⋮ On random stable partitions ⋮ Strategy-proof contract auctions and the role of ties ⋮ Efficient reallocation under additive and responsive preferences ⋮ Unnamed Item ⋮ Improving solution times for stable matching problems through preprocessing ⋮ Stable matching games: manipulation via subgraph isomorphism ⋮ Complexity of finding Pareto-efficient allocations of highest welfare ⋮ A bargaining set for roommate problems ⋮ Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity ⋮ An efficient implementation of the Gale and Shapley “propose-and-reject” algorithm ⋮ Counting houses of Pareto optimal matchings in the house allocation problem ⋮ An impossibility result for housing markets with fractional endowments ⋮ Stable Matching with Uncertain Linear Preferences ⋮ The Stable Roommates Problem with Short Lists ⋮ The diameter of the stable marriage polytope: bounding from below ⋮ Pairwise Preferences in the Stable Marriage Problem ⋮ Stable matchings with covering constraints: a complete computational trichotomy ⋮ Stable matching with uncertain linear preferences ⋮ Popular Matchings in Complete Graphs ⋮ The Stable Fixtures Problem with Payments ⋮ Student-project allocation with preferences over projects: algorithmic and experimental results ⋮ Almost mutually best in matching markets: rank gaps and size of the core ⋮ On the Stable Matchings That Can Be Reached When the Agents Go Marching in One By One ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Size versus truthfulness in the house allocation problem ⋮ On the convergence of swap dynamics to Pareto-optimal matchings ⋮ College admissions with ties and common quotas: integer programming approach ⋮ Stable matching with uncertain pairwise preferences ⋮ A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences ⋮ The stable marriage problem with ties and restricted edges ⋮ Popularity, Mixed Matchings, and Self-Duality ⋮ Envy-freeness in house allocation problems ⋮ Pareto optimality in many-to-many matching problems ⋮ Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters ⋮ A 3 / 2 -approximation Algorithm for the Student-Project Allocation Problem
This page was built for publication: Algorithmics of Matching Under Preferences
