TY - GEN
T1 - Voluntary mobility clustering for epidemic control
AU - Esmaieeli Sikaroudi, Amir Mohammad
AU - Efrat, Alon
AU - Mitchell, Joseph
AU - Arkin, Esther M.
N1 - Publisher Copyright:
© 2025 Copyright held by the owner/author(s).
PY - 2025/12/12
Y1 - 2025/12/12
N2 - In case of a future pandemic, the mobility dynamics of a city can be controlled by intervening in the mobility patterns of people. Instead of hard quarantine policies, incentives can be designed that are compatible with people's preferences. At first, we distinguish mobility from the different types of locations for which distance matters. We match these types of locations in a way that maximizes the natural preference of people to visit the locations. We investigate different approaches for matching locations, such as retail and educational services, while considering people's preferences. We show that satisfying the preferences of the entire city is a computationally hard problem. Approximation algorithms are proposed in which the penalty for preference violation is bounded. We propose a fast approximation algorithm that focuses on the penalty value of locations, and we propose a more computationally heavy approximation that focuses on user penalty with a specific scheme of user allocation to locations. Additionally, we investigated higher-order matching of locations and the complexity of urban partitioning. We tested our approach in Euclidean space and network space. Finally, we show that applying such mobility restrictions can reduce the transmission rate, and we extract cells whose people can be incentivized to fulfill their needs based on the proposed algorithms, slowing down a future pandemic and preventing potential superspreading events.
AB - In case of a future pandemic, the mobility dynamics of a city can be controlled by intervening in the mobility patterns of people. Instead of hard quarantine policies, incentives can be designed that are compatible with people's preferences. At first, we distinguish mobility from the different types of locations for which distance matters. We match these types of locations in a way that maximizes the natural preference of people to visit the locations. We investigate different approaches for matching locations, such as retail and educational services, while considering people's preferences. We show that satisfying the preferences of the entire city is a computationally hard problem. Approximation algorithms are proposed in which the penalty for preference violation is bounded. We propose a fast approximation algorithm that focuses on the penalty value of locations, and we propose a more computationally heavy approximation that focuses on user penalty with a specific scheme of user allocation to locations. Additionally, we investigated higher-order matching of locations and the complexity of urban partitioning. We tested our approach in Euclidean space and network space. Finally, we show that applying such mobility restrictions can reduce the transmission rate, and we extract cells whose people can be incentivized to fulfill their needs based on the proposed algorithms, slowing down a future pandemic and preventing potential superspreading events.
KW - geospatial algorithms
KW - matching
KW - mobility constraints
KW - pandemic
UR - https://www.scopus.com/pages/publications/105025571192
U2 - 10.1145/3748636.3762768
DO - 10.1145/3748636.3762768
M3 - Conference contribution
AN - SCOPUS:105025571192
T3 - 33rd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL 2025
SP - 557
EP - 560
BT - 33rd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL 2025
A2 - Mokbel, Mohamed
A2 - Shekar, Shashi
A2 - Zufle, Andreas
A2 - Chiang, Yao-Yi
A2 - Damiani, Maria Luisa
A2 - Youssef, Moustafa
PB - Association for Computing Machinery, Inc
T2 - 33rd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL 2025
Y2 - 3 November 2025 through 6 November 2025
ER -