The Stable Fixtures Problem with Payments
- Submitting institution
-
University of Durham
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 108104
- Type
- D - Journal article
- DOI
-
10.1016/j.geb.2017.02.002
- Title of journal
- Games and Economic Behavior
- Article number
- -
- First page
- 245
- Volume
- 108
- Issue
- -
- ISSN
- 08998256
- Open access status
- Access exception
- Month of publication
- -
- Year of publication
- 2017
- URL
-
https://doi.org/10.1016/j.geb.2017.02.002
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
B - Algorithms and Complexity
- Citation count
- 3
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper completed a long-standing study on matching games by considering the most general model. Afterwards "P. Biro, W. Kern, D. Palvolgyi and D. Paulusma, Generalized matching games for international kidney exchange, Proc. AAMAS 2019, 413-421" solved the two main open problems of the paper and linked the model to matching games for international kidney exchange programs. The REF-submission also inspired "S. Kumabe, T. Maehara, Convexity of b-matching Games. Proc. IJCAI 2020, 261-267" which, after citing our results, states: "the b-matching game is computationally hard (..) Therefore, we focus on the convexity of the game (..)".
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -