Fair Assignment for Reserved Nucleic Acid Testing

Abstract

Corona Virus Disease 2019 (COVID-19) is now treating the health of millions of people worldwide. The Chinese government now applies nucleic acid testing as a tool to detect patients from healthy people to control the spread of COVID-19. However, people may come to the nucleic acid testing stations simultaneously, leading to long queues and wasting time. In this paper, we proposed the reserved nucleic acid testing method, which could be easily implemented via Web applications associated with nucleic acid testing. Its key idea is to assign people to different pre-scheduled time slots so that the number of people arriving at a certain time slot can be controlled under the capacity, and thus congestion can be relieved. The key question is how to assign people in a fair manner. We propose a concise model to formalize and analyze the minimum total envy and pairwise fairness assignment problem for a variety of reservation-based applications, including nuclear acid testing. Its objective is to maximize the sum of each person’s utility under the capacity constraints of time slots. The decision variables are the time slot assignment of each person. We show that the envy-freeness solution is usually unavailable. However, we can minimize the total envy through appropriate arrangements and realize pairwise fairness with equal-chance shuffling.

Theoretical Trade-Off Between Fairness and Efficiency in the Cooperative Driving Problem for CAVs at On-Ramps

“…Fairness usually refers to the fair and appropriate distribution of benefits and costs among people [32]. In the field of transportation studies, the definition and measurement of fairness vary significantly based on specific application scenarios, such as the transport provision and demand [33]- [36], environmental externalities of transport systems [37], road pricing, congestion charges, and travel costs [38]- [40], and opportunities for work and other matters [41], [42].…”