Understanding many-to-many matching relationship and its correlation with joint response

被引:7
|
作者
Zhang, Dapeng [1 ]
Wang, Xiaokun [2 ]
机构
[1] Rensselaer Polytech Inst, Dept Civil & Environm Engn, 5304 JEC Bldg,110 8th St, Troy, NY 12180 USA
[2] Rensselaer Polytech Inst, Dept Civil & Environm Engn, 4032 JEC Bldg,110 8th St, Troy, NY 12180 USA
关键词
Many-to-many; Joint response; Matching model; Sample selection; Bayesian MCMC; AIRLINES; ENTRY; AIRPORTS; MARRIAGE; MODEL; CITY;
D O I
10.1016/j.trb.2017.12.011
中图分类号
F [经济];
学科分类号
02 ;
摘要
Many-to-many matching relationship in a two-sided market has been widely observed in today's transportation activities. Observation of such matching relationship raises some interesting questions: what factors drive the matching of two agents? Is the formation of matching relationship related with joint behavior which may lead to different understandings of planning and operation? To answer these questions, econometric models may be the best methodology. However, to the authors' best knowledge, there lacks a well established econometric model to explain the observed data that contains matching relationship in a two-sided transportation market. Therefore, this paper proposes an innovative ordinal joint response model to bridge the gap. The proposed model consists of two regression equations: the first uses a latent dependent variable to disentangle the many-to-many matching relationship; the second specifies an ordered probit equation to investigate the ordinal outcome of joint behavior. Error terms of the two equations are assumed correlated to capture the correlation of the matching process and joint behavior. An example of airline-airport matching is used to demonstrate the proposed model. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:249 / 260
页数:12
相关论文
共 50 条
  • [31] A Many-to-One Algorithm to Solve a Many-to-Many Matching Problem for Routing
    Guo, Wenjing
    van Blokland, Wouter Beelaerts
    Negenborn, Rudy R.
    COMPUTATIONAL LOGISTICS (ICCL 2018), 2018, 11184 : 279 - 294
  • [32] Binary Operations for the Lattice Structure in a Many-to-Many Matching Model
    Paola Belén Manasero
    Journal of the Operations Research Society of China, 2021, 9 : 207 - 228
  • [33] Many-to-Many Matching under the l1 Norm
    Demirci, M. Fatih
    Osmanlioglu, Yusuf
    IMAGE ANALYSIS AND PROCESSING - ICIAP 2009, PROCEEDINGS, 2009, 5716 : 787 - 796
  • [34] Take-it-or-leave-it contracts in many-to-many matching markets
    Romero-Medina, Antonio
    Triossi, Matteo
    ECONOMIC THEORY, 2023, 75 (02) : 591 - 623
  • [35] MADMatch: Many-to-Many Approximate Diagram Matching for Design Comparison
    Kpodjedo, Segla
    Ricca, Filippo
    Galinier, Philippe
    Antoniol, Giuliano
    Gueheneuc, Yann-Gael
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2013, 39 (08) : 1090 - 1111
  • [36] Binary Operations for the Lattice Structure in a Many-to-Many Matching Model
    Manasero, Paola Belen
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2021, 9 (01) : 207 - 228
  • [37] Finding a minimum-regret many-to-many Stable Matching
    Eirinakis, Pavlos
    Magos, Dimitrios
    Mourtos, Ioannis
    Miliotis, Panayiotis
    OPTIMIZATION, 2013, 62 (08) : 1007 - 1018
  • [38] Many-to-Many Matching With Externalities for Device-to-Device Communications
    Zhao, Jingjing
    Liu, Yuanwei
    Chai, Kok Keong
    Chen, Yue
    Elkashlan, Maged
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2017, 6 (01) : 138 - 141
  • [39] On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets
    Paula Jaramillo
    Çaǧatay Kayı
    Flip Klijn
    Social Choice and Welfare, 2014, 42 : 793 - 811
  • [40] Many-to-many matching based task allocation for dispersed computing
    Hongwen Hui
    Fuhong Lin
    Lei Meng
    Lei Yang
    Xianwei Zhou
    Computing, 2023, 105 : 1497 - 1522