Two-Sided Matchings : An Algorithm for Ensuring They are Minimax and Pareto-Optimal
Year of publication: |
2013
|
---|---|
Authors: | Brams, Steven J. |
Other Persons: | Kilgour, D. Marc (contributor) |
Publisher: |
[2013]: [S.l.] : SSRN |
Subject: | Theorie | Theory | Matching | Pareto-Optimum | Pareto efficiency | Algorithmus | Algorithm |
Extent: | 1 Online-Ressource (30 p) |
---|---|
Type of publication: | Book / Working Paper |
Language: | English |
Notes: | Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments July 2013 erstellt |
Other identifiers: | 10.2139/ssrn.2290795 [DOI] |
Classification: | C61 - Optimization Techniques; Programming Models; Dynamic Analysis ; C71 - Cooperative Games ; C78 - Bargaining Theory; Matching Theory |
Source: | ECONIS - Online Catalogue of the ZBW |
-
Transfers and exchange-stability in two-sided matching problems
Lazarova, Emiliya A., (2014)
-
Fractional solutions for capacitated NTU-games, with applications to stable matchings
Biró, Péter, (2012)
-
A new solution for the roommate problem : the Q-stable matchings
Biró, Péter, (2014)
- More ...
-
Single-peakedness and disconnected coalitions
Brams, Steven J., (2002)
-
A note on stabilizing cooperation in the centipede game
Brams, Steven J., (2020)
-
Putting the other side "on notice" can induce compliance in arms control
Kilgour, D. Marc, (1992)
- More ...