Arbitrated Matching: Formulation and Protocol
Publication Type
Journal Article
Publication Date
1996
Abstract
This paper presents an arbitration approach to bipartite matching in which a set of actors are matched up with a set of mates in a one-to-one manner. The arbitration is composed of two stages, viz. stage I in which ordinal preference is elicited on a need-to basis until all stable matchings are obtained. Stage II is sequential bargaining in which risk preference information is extracted by eliciting certainty equivalents of default randomizations declared by the arbitrator. Stage II comes out with a particular stable subset, randomization of which is preferable for all, to that of the entire stable set. Stage II is particularly effective when actors and mates are risk-averse, whence reducing uncertainty with a smaller randomization set proves to be advantageous to all. We also prove that it is superior to the traditional one-off approach in terms of the elicitation effort required as well as strategyproofness.
Keywords
Bipartite matching, Arbitration, Bargaining
Discipline
Databases and Information Systems
Publication
European Journal of Operations Research
Volume
88
Issue
2
First Page
348
Last Page
357
ISSN
0377-2217
Identifier
10.1016/0377-2217(94)00182-0
Publisher
Elsevier
Citation
NG, W. Y.; CHOI, K. W.; and SHUM, Kam Hong.
Arbitrated Matching: Formulation and Protocol. (1996). European Journal of Operations Research. 88, (2), 348-357.
Available at: https://ink.library.smu.edu.sg/sis_research/1069
Additional URL
http://dx.doi.org/10.1016/0377-2217(94)00182-0