The revealed preference theory of stable matchings with one-sided preferences

被引:4
|
作者
Hu, Gaoji [1 ]
Li, Jiangtao [2 ]
Tang, Rui [3 ]
机构
[1] Shanghai Univ Finance & Econ, Sch Econ, Shanghai, Peoples R China
[2] Singapore Management Univ, Sch Econ, Singapore, Singapore
[3] Princeton Univ, Dept Econ, Princeton, NJ 08544 USA
关键词
Revealed preference; Stable matchings; One-sided preferences; Lattice structure; LATTICE; SET;
D O I
10.1016/j.geb.2020.08.015
中图分类号
F [经济];
学科分类号
02 ;
摘要
We investigate the testable implications of the theory of stable matchings in two-sided matching markets with one-sided preferences. Our main result connects the revealed preference analysis to the well-known lattice structure of the set of stable matchings, and tests the rationalizability of a data set by analyzing the joins and meets of matchings. (c) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页码:305 / 318
页数:14
相关论文
共 50 条
  • [1] Matchings under One-Sided Preferences with Soft Quotas
    Santhini, K. A.
    Ravi, Raghu Raman
    Nasre, Meghana
    [J]. PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 2774 - 2782
  • [2] Popular Matchings with Two-Sided Preferences and One-Sided Ties
    Cseh, Agnes
    Huang, Chien-Chung
    Kavitha, Telikepalli
    [J]. Automata, Languages, and Programming, Pt I, 2015, 9134 : 367 - 379
  • [3] POPULAR MATCHINGS WITH TWO-SIDED PREFERENCES AND ONE-SIDED TIES
    Cseh, Agnes
    Huang, Chien-Chung
    Kavitha, Telikepalli
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (04) : 2348 - 2377
  • [4] Stable Matchings, One-Sided Ties, and Approximate Popularity
    Kavitha, Telikepalli
    [J]. ALGORITHMICA, 2024, 86 (06) : 1888 - 1920
  • [5] THE REVEALED PREFERENCE THEORY OF STABLE AND EXTREMAL STABLE MATCHINGS
    Echenique, Federico
    Lee, Sangmok
    Shum, Matthew
    Yenmez, M. Bumin
    [J]. ECONOMETRICA, 2013, 81 (01) : 153 - 171
  • [6] Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties
    Gopal, Kavitha
    Nasre, Meghana
    Nimbhorkar, Prajakta
    Reddy, T. Pradeep
    [J]. COMPUTING AND COMBINATORICS, COCOON 2019, 2019, 11653 : 193 - 205
  • [7] PARETO STABLE MATCHINGS UNDER ONE-SIDED MATROID CONSTRAINTS
    Kamiyama, Naoyuki
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2019, 33 (03) : 1431 - 1451
  • [8] Envy-free matchings with one-sided preferences and matroid constraints
    Kamiyama, Naoyuki
    [J]. OPERATIONS RESEARCH LETTERS, 2021, 49 (05) : 790 - 794
  • [9] Necessarily Optimal One-Sided Matchings
    Hosseini, Hadi
    Menon, Vijay
    Shah, Nisarg
    Sikdar, Sujoy
    [J]. THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 5481 - 5488
  • [10] Popular Matchings with One-Sided Bias
    Kavitha, Telikepalli
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2024, 20 (01)