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

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.

Authors

Institutions

Publication Details

Journal
Social Choice and Welfare
Published
2025-01-10
DOI
https://doi.org/10.1007/s00355-024-01581-8
Citations
1
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
1.24

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Min-Hung Tsay, Chun‐Hsien Yeh, Lan-Yi Liu
1 citations
Social Choice and Welfare
Scheduling and Optimization Algorithms
1.24
article

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

Min-Hung Tsay, Chun‐Hsien Yeh, Lan-Yi Liu
article en
1 citations

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.

Social Choice and WelfareVol. 65(2)
National Taiwan University (TW), Research Center for Humanities and Social Sciences, Academia Sinica (TW), Institute of Economics, Academia Sinica (TW), National Taipei University (TW)
Academia Sinica, National Science and Technology Council
Reduced inequalities
Openalex Percentile: Top 23%
Scheduling and Optimization Algorithms
1.24
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Axiomatic and strategic foundations for the pairwise equal splitting rule in sequencing problems with an initial queue — Min-Hung Tsay, Chun‐Hsien Yeh, et al. · Social Choice and Welfare (2025) | TGRS Research Map | TGRS