IDEAS home Printed from https://ideas.repec.org/a/spr/sochwe/v65y2025i2d10.1007_s00355-024-01581-8.html

Axiomatic and strategic foundations for the pairwise equal splitting rule in sequencing problems with an initial queue

Author

Listed:
  • Min-Hung Tsay

    (Academia Sinica)

  • Chun-Hsien Yeh

    (Academia Sinica)

  • Lan-Yi Liu

    (National Taiwan University)

Abstract

We consider the sequencing problem with an initial queue from both axiomatic and strategic perspectives. First, we show that two fairness properties, namely independence of irrelevant adjacent positions swap and balanced impact of adjacent positions swap, along with the basic properties of efficiency, budget balance, individual rationality and Pareto indifference, characterize the pairwise equal splitting rule (Curiel et al. 1989). Next, we establish a strategic justification for the rule by introducing a position-negotiation game. This game is a finite-round game, with each round consisting of a sequence of bilateral bargaining sessions. We show that there is a unique subgame perfect Nash equilibrium outcome in the game; moreover, it is the agents’ net utility profile under the rule.

Suggested Citation

  • Min-Hung Tsay & Chun-Hsien Yeh & Lan-Yi Liu, 2025. "Axiomatic and strategic foundations for the pairwise equal splitting rule in sequencing problems with an initial queue," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 65(2), pages 335-361, September.
    • Handle: RePEc:spr:sochwe:v:65:y:2025:i:2:d:10.1007_s00355-024-01581-8
    DOI: 10.1007/s00355-024-01581-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00355-024-01581-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00355-024-01581-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Ju, Yuan & Chun, Youngsub & van den Brink, René, 2014. "Auctioning and selling positions: A non-cooperative approach to queueing conflicts," Journal of Economic Theory, Elsevier, vol. 153(C), pages 33-45.
    2. Chun, Youngsub & Mitra, Manipushpak & Mutuswami, Suresh, 2019. "A characterization of the symmetrically balanced VCG rule in the queueing problem," Games and Economic Behavior, Elsevier, vol. 118(C), pages 486-490.
    3. SCHMEIDLER, David, 1969. "The nucleolus of a characteristic function game," LIDAM Reprints CORE 44, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Serrano, Roberto, 1995. "Strategic bargaining, surplus sharing problems and the nucleolus," Journal of Mathematical Economics, Elsevier, vol. 24(4), pages 319-329.
    5. KayI, Çagatay & Ramaekers, Eve, 2010. "Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems," Games and Economic Behavior, Elsevier, vol. 68(1), pages 220-232, January.
    6. Maniquet, Francois, 2003. "A characterization of the Shapley value in queueing problems," Journal of Economic Theory, Elsevier, vol. 109(1), pages 90-103, March.
    7. Yang, Guangjing & Sun, Hao & Hou, Dongshuang & Xu, Genjiu, 2019. "Games in sequencing situations with externalities," European Journal of Operational Research, Elsevier, vol. 278(2), pages 699-708.
    8. Jeroen Suijs, 1996. "On incentive compatibility and budget balancedness in public decision making," Review of Economic Design, Springer;Society for Economic Design, vol. 2(1), pages 193-209, December.
    9. Tsay, Min-Hung & Yeh, Chun-Hsien, 2019. "Relations among the central rules in bankruptcy problems: A strategic perspective," Games and Economic Behavior, Elsevier, vol. 113(C), pages 515-532.
    10. Wayne E. Smith, 1956. "Various optimizers for single‐stage production," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 59-66, March.
    11. Alex Gershkov & Paul Schweinzer, 2010. "When queueing is better than push and shove," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(3), pages 409-430, July.
    12. Perez-Castrillo, David & Wettstein, David, 2001. "Bidding for the Surplus : A Non-cooperative Approach to the Shapley Value," Journal of Economic Theory, Elsevier, vol. 100(2), pages 274-294, October.
    13. Youngsub Chun, 2011. "Consistency and monotonicity in sequencing problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(1), pages 29-41, February.
    14. Robert J. Dolan, 1978. "Incentive Mechanisms for Priority Queuing Problems," Bell Journal of Economics, The RAND Corporation, vol. 9(2), pages 421-436, Autumn.
    15. Vijay Krishna & Roberto Serrano, 1996. "Multilateral Bargaining," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 63(1), pages 61-80.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Min-Hung Tsay & Youngsub Chun & Rene van den Brink & Chun-Hsien Yeh, 2025. "The Consistency Principle in the Reordering Problem," Tinbergen Institute Discussion Papers 25-050/II, Tinbergen Institute.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tsay, Min-Hung & Yeh, Chun-Hsien & Chun, Youngsub, 2025. "Axiomatic and strategic justifications of the connected equal splitting rule in the reordering problem," Journal of Mathematical Economics, Elsevier, vol. 117(C).
    2. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2019. "Recent developments in the queueing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(1), pages 1-23, April.
    3. Sreoshi Banerjee & Parikshit De & Manipushpak Mitra, 2024. "Generalized welfare lower bounds and strategyproofness in sequencing problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 63(2), pages 323-357, September.
    4. Banerjee, Sreoshi, 2024. "On identifying efficient, fair and stable allocations in "generalized" sequencing games," MPRA Paper 120188, University Library of Munich, Germany.
    5. Banerjee, Sreoshi & De, Parikshit & Mitra, Manipushpak, 2020. "A welfarist approach to sequencing problems with incentives," MPRA Paper 107188, University Library of Munich, Germany.
    6. Ju, Yuan & Chun, Youngsub & van den Brink, René, 2014. "Auctioning and selling positions: A non-cooperative approach to queueing conflicts," Journal of Economic Theory, Elsevier, vol. 153(C), pages 33-45.
    7. Atay, Ata & Trudeau, Christian, 2024. "Queueing games with an endogenous number of machines," Games and Economic Behavior, Elsevier, vol. 144(C), pages 104-125.
    8. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2023. "Balanced VCG mechanisms for sequencing problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 60(1), pages 35-46, January.
    9. Banerjee, Sreoshi, 2023. "Stability and fairness in sequencing games: optimistic approach and pessimistic scenarios," MPRA Paper 118680, University Library of Munich, Germany.
    10. Schouten, Jop, 2022. "Cooperation, allocation and strategy in interactive decision-making," Other publications TiSEM d5d41448-8033-4f6b-8ec0-c, Tilburg University, School of Economics and Management.
    11. Dube, Devwrat, 2025. "The Knapsack Sequencing Problem: Computational Complexity and Mechanism Design," MPRA Paper 126600, University Library of Munich, Germany.
    12. Van Essen, Matt & Wooders, John, 2021. "Allocating positions fairly: Auctions and Shapley value," Journal of Economic Theory, Elsevier, vol. 196(C).
    13. Min-Hung Tsay & Youngsub Chun & Rene van den Brink & Chun-Hsien Yeh, 2025. "The Consistency Principle in the Reordering Problem," Tinbergen Institute Discussion Papers 25-050/II, Tinbergen Institute.
    14. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2017. "Reordering an existing queue," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(1), pages 65-87, June.
    15. Kazuhiko Hashimoto & Hiroki Saitoh, 2012. "Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(3), pages 473-480, March.
    16. Chun, Youngsub & Mitra, Manipushpak, 2014. "Subgroup additivity in the queueing problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 281-289.
    17. Juan D. Moreno-Ternero & Min-Hung Tsay & Chun-Hsien Yeh, 2020. "A strategic justification of the Talmud rule based on lower and upper bounds," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(4), pages 1045-1057, December.
    18. Parikshit De & Manipushpak Mitra, 2017. "Incentives and justice for sequencing problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 64(2), pages 239-264, August.
    19. Dube, Devwrat, 2025. "Mechanism Design for Queueing with Capacity-Constrained Shifts," MPRA Paper 126465, University Library of Munich, Germany.
    20. Hu, Cheng-Cheng & Tsay, Min-Hung & Yeh, Chun-Hsien, 2018. "A study of the nucleolus in the nested cost-sharing problem: Axiomatic and strategic perspectives," Games and Economic Behavior, Elsevier, vol. 109(C), pages 82-98.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:65:y:2025:i:2:d:10.1007_s00355-024-01581-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.