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 条
  • [21] Many-to-many graph matching via metric embedding
    Keselman, Y
    Shokoufandeh, A
    Demirci, MF
    Dickinson, S
    2003 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2003, : 850 - 857
  • [22] Many-to-many matching with max-min preferences
    Hatfield, John William
    Kojima, Fuhito
    Narita, Yusuke
    DISCRETE APPLIED MATHEMATICS, 2014, 179 : 235 - 240
  • [23] Credible group stability in many-to-many matching problems
    Konishi, Hideo
    Unver, M. Utku
    JOURNAL OF ECONOMIC THEORY, 2006, 129 (01) : 57 - 80
  • [24] Many-to-Many Graph Matching: A Continuous Relaxation Approach
    Zaslavskiy, Mikhail
    Bach, Francis
    Vert, Jean-Philippe
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, PT III, 2010, 6323 : 515 - 530
  • [25] Role of common preferences in the outcome of many-to-many matching
    Lee, Joonbae
    ECONOMICS LETTERS, 2022, 217
  • [26] Many-to-Many Matching in l1 Norm
    Demirci, M. Fatih
    2008 IEEE 16TH SIGNAL PROCESSING, COMMUNICATION AND APPLICATIONS CONFERENCE, VOLS 1 AND 2, 2008, : 144 - 147
  • [27] DOMINANCE INDEX FOR MANY-TO-MANY CORRELATION AND ITS APPLICAIONS TO SEMICONDUCTOR YIELD ANALYSIS
    Hong, Amos
    Chen, Argon
    2012 WINTER SIMULATION CONFERENCE (WSC), 2012,
  • [28] Fast Computation of Clustered Many-to-many Shortest Paths and Its Application to Map Matching
    Jagadeesh, George R.
    Srikanthan, Thambipillai
    ACM TRANSACTIONS ON SPATIAL ALGORITHMS AND SYSTEMS, 2019, 5 (03)
  • [29] Take-it-or-leave-it contracts in many-to-many matching markets
    Antonio Romero-Medina
    Matteo Triossi
    Economic Theory, 2023, 75 : 591 - 623
  • [30] The stability of many-to-many matching with max-min preferences
    Jiao, Zhenhua
    Tian, Guoqiang
    ECONOMICS LETTERS, 2015, 129 : 52 - 56