Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains
Year of publication: |
2024
|
---|---|
Authors: | Biró, Péter ; Csáji, Gergely |
Subject: | Computation complexity | Core | Lexicographic preferences | Many-to-many matching | Stable matchings | Matching | Präferenztheorie | Theory of preferences | Kooperatives Spiel | Cooperative game | Spieltheorie | Game theory | Suchtheorie | Search theory |
-
Almost mutually best in matching markets : rank-fairness and size of the core
Klijn, Flip, (2019)
-
A theory of stability in many-to-many matching markets
Echenique, Federico, (2006)
-
The stability of many-to-many matching with max-min preferences
Jiao, Zhenhua, (2015)
- More ...
-
Manipulating the outcome of stable marriage and roommates problems
Bérczi, Kristóf, (2024)
-
Analysis of Stochastic Matching Markets
Biró, Péter, (2011)
-
Computing Solutions for Matching Games
Biró, Péter, (2011)
- More ...