Optimal Workplace Occupancy Strategies during the COVID-19 Pandemic

Mansoor Davoodi; Abhishek Senapati; Adam Mertel; Weronika Schlechte-Welnicz; Justin M. Calabrese

Home/Archive/arXiv

arXiv · 2204.01444

Optimal Workplace Occupancy Strategies during the COVID-19 Pandemic

Mansoor Davoodi·Abhishek Senapati·Adam Mertel·Weronika Schlechte-Welnicz·Justin M. Calabrese

View original source ↗Read source document ↗Export metadata ↓

Abstract

During the COVID-19 pandemic, many organizations (e.g. businesses, companies, government facilities, etc.) have attempted to reduce infection risk by employing partial home office strategies. However, working from home can also reduce productivity for certain types of work and particular employees. Over the long term, many organizations therefore face a need to balance infection risk against productivity. Motivated by this trade-off, we model this situation as a bi-objective optimization problem and propose a practical approach to find trade-off (Pareto optimal) solutions. We present a new probabilistic framework to compute the expected number of infected employees as a function of key parameters including: the incidence level in the neighborhood of the organization, the COVID-19 transmission rate, the number of employees, the percentage of vaccinated employees, the testing frequency, and the contact rate among employees. We implement the model and the optimization algorithm and perform several numerical experiments with different parameter settings. Furthermore, we provide an online application based on the models and algorithms developed in this paper, which can be used to identify the optimal workplace occupancy rate for real-world organizations.

Explore related subjects

cs.DS math.OC

Keep this discovery

BibTeX RIS

Mansoor Davoodi, Abhishek Senapati, Adam Mertel, Weronika Schlechte-Welnicz, Justin M. Calabrese. 2022-04-04. Optimal Workplace Occupancy Strategies during the COVID-19 Pandemic. https://arxiv.org/abs/2204.01444

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗