Stochastic k-Server: How Should Uber Work?

In this paper we study a stochastic variant of the celebrated $k$-server problem. In the k-server problem, we are required to minimize the total movement of k servers that are serving an online sequence of $t$ requests in a metric. In the stochastic setting we are given t independent distributions in advance, and at every time step i a request is drawn from P_i. Designing the optimal online algorithm in such setting is NP-hard, therefore the emphasis of our work is on designing an approximately optimal online algorithm. We first show a structural characterization for a certain class of non-adaptive online algorithms. We prove that in general metrics, the best of such algorithms has a cost of no worse than three times that of the optimal online algorithm. Next, we present an integer program that finds the optimal algorithm of this class for any arbitrary metric. Finally by rounding the solution of the linear relaxation of this program, we present an online algorithm for the stochastic k-server problem with an approximation factor of $3$ in the line and circle metrics and factor of O(log n) in general metrics. In this way, we achieve an approximation factor that is independent of k, the number of servers. Moreover, we define the Uber problem, motivated by extraordinary growth of online network transportation services. In the Uber problem, each demand consists of two points -a source and a destination- in the metric. Serving a demand is to move a server to its source and then to its destination. The objective is again minimizing the total movement of the k given servers. It is not hard to show that given an alpha-approximation algorithm for the k-server problem, we can obtain a max{3,alpha}-approximation algorithm for the Uber problem. Motivated by the fact that demands are usually highly correlated with the time (e.g. what day of the week or what time of the day the demand is arrived), we study the stochastic Uber problem. Using our results for stochastic k-server we can obtain a 3-approximation algorithm for the stochastic Uber problem in line and circle metrics, and a O(log n)-approximation algorithm for a general metric of size n. Furthermore, we extend our results to the correlated setting where the probability of a request arriving at a certain point depends not only on the time step but also on the previously arrived requests

Greedy Algorithms for Online Survivable Network Design

In an instance of the network design problem, we are given a graph G=(V,E), an edge-cost function c:E -> R^{>= 0}, and a connectivity criterion. The goal is to find a minimum-cost subgraph H of G that meets the connectivity requirements. An important family of this class is the survivable network design problem (SNDP): given non-negative integers r_{u v} for each pair u,v in V, the solution subgraph H should contain r_{u v} edge-disjoint paths for each pair u and v. While this problem is known to admit good approximation algorithms in the offline case, the problem is much harder in the online setting. Gupta, Krishnaswamy, and Ravi [Gupta et al., 2012] (STOC\u2709) are the first to consider the online survivable network design problem. They demonstrate an algorithm with competitive ratio of O(k log^3 n), where k=max_{u,v} r_{u v}. Note that the competitive ratio of the algorithm by Gupta et al. grows linearly in k. Since then, an important open problem in the online community [Naor et al., 2011; Gupta et al., 2012] is whether the linear dependence on k can be reduced to a logarithmic dependency. Consider an online greedy algorithm that connects every demand by adding a minimum cost set of edges to H. Surprisingly, we show that this greedy algorithm significantly improves the competitive ratio when a congestion of 2 is allowed on the edges or when the model is stochastic. While our algorithm is fairly simple, our analysis requires a deep understanding of k-connected graphs. In particular, we prove that the greedy algorithm is O(log^2 n log k)-competitive if one satisfies every demand between u and v by r_{uv}/2 edge-disjoint paths. The spirit of our result is similar to the work of Chuzhoy and Li [Chuzhoy and Li, 2012] (FOCS\u2712), in which the authors give a polylogarithmic approximation algorithm for edge-disjoint paths with congestion 2. Moreover, we study the greedy algorithm in the online stochastic setting. We consider the i.i.d. model, where each online demand is drawn from a single probability distribution, the unknown i.i.d. model, where every demand is drawn from a single but unknown probability distribution, and the prophet model in which online demands are drawn from (possibly) different probability distributions. Through a different analysis, we prove that a similar greedy algorithm is constant competitive for the i.i.d. and the prophet models. Also, the greedy algorithm is O(log n)-competitive for the unknown i.i.d. model, which is almost tight due to the lower bound of [Garg et al., 2008] for single connectivity

Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering

We design the first online algorithm with poly-logarithmic competitive ratio for the edge-weighted degree-bounded Steiner forest (EW-DB-SF) problem and its generalized variant. We obtain our result by demonstrating a new generic approach for solving mixed packing/covering integer programs in the online paradigm. In EW-DB-SF, we are given an edge-weighted graph with a degree bound for every vertex. Given a root vertex in advance, we receive a sequence of terminal vertices in an online manner. Upon the arrival of a terminal, we need to augment our solution subgraph to connect the new terminal to the root. The goal is to minimize the total weight of the solution while respecting the degree bounds on the vertices. In the offline setting, edge-weighted degree-bounded Steiner tree (EW-DB-ST) and its many variations have been extensively studied since early eighties. Unfortunately, the recent advancements in the online network design problems are inherently difficult to adapt for degree-bounded problems. In particular, it is not known whether the fractional solution obtained by standard primal-dual techniques for mixed packing/covering LPs can be rounded online. In contrast, in this paper we obtain our result by using structural properties of the optimal solution, and reducing the EW-DB-SF problem to an exponential-size mixed packing/covering integer program in which every variable appears only once in covering constraints. We then design a generic integral algorithm for solving this restricted family of IPs. As mentioned above, we demonstrate a new technique for solving mixed packing/covering integer programs. Define the covering frequency k of a program as the maximum number of covering constraints in which a variable can participate. Let m denote the number of packing constraints. We design an online deterministic integral algorithm with competitive ratio of O(k*log(m)) for the mixed packing/covering integer programs. We prove the tightness of our result by providing a matching lower bound for any randomized algorithm. We note that our solution solely depends on m and k. Indeed, there can be exponentially many variables. Furthermore, our algorithm directly provides an integral solution, even if the integrality gap of the program is unbounded. We believe this technique can be used as an interesting alternative for the standard primal-dual techniques in solving online problems

Measuring the availability of human resources for health and its relationship to universal health coverage for 204 countries and territories from 1990 to 2019: a systematic analysis for the Global Burden of Disease Study 2019

Background: Human resources for health (HRH) include a range of occupations that aim to promote or improve human health. The UN Sustainable Development Goals (SDGs) and the WHO Health Workforce 2030 strategy have drawn attention to the importance of HRH for achieving policy priorities such as universal health coverage (UHC). Although previous research has found substantial global disparities in HRH, the absence of comparable cross-national estimates of existing workforces has hindered efforts to quantify workforce requirements to meet health system goals. We aimed to use comparable and standardised data sources to estimate HRH densities globally, and to examine the relationship between a subset of HRH cadres and UHC effective coverage performance. Methods: Through the International Labour Organization and Global Health Data Exchange databases, we identified 1404 country-years of data from labour force surveys and 69 country-years of census data, with detailed microdata on health-related employment. From the WHO National Health Workforce Accounts, we identified 2950 country-years of data. We mapped data from all occupational coding systems to the International Standard Classification of Occupations 1988 (ISCO-88), allowing for standardised estimation of densities for 16 categories of health workers across the full time series. Using data from 1990 to 2019 for 196 of 204 countries and territories, covering seven Global Burden of Diseases, Injuries, and Risk Factors Study (GBD) super-regions and 21 regions, we applied spatiotemporal Gaussian process regression (ST-GPR) to model HRH densities from 1990 to 2019 for all countries and territories. We used stochastic frontier meta-regression to model the relationship between the UHC effective coverage index and densities for the four categories of health workers enumerated in SDG indicator 3.c.1 pertaining to HRH: physicians, nurses and midwives, dentistry personnel, and pharmaceutical personnel. We identified minimum workforce density thresholds required to meet a specified target of 80 out of 100 on the UHC effective coverage index, and quantified national shortages with respect to those minimum thresholds. Findings: We estimated that, in 2019, the world had 104·0 million (95% uncertainty interval 83·5–128·0) health workers, including 12·8 million (9·7–16·6) physicians, 29·8 million (23·3–37·7) nurses and midwives, 4·6 million (3·6–6·0) dentistry personnel, and 5·2 million (4·0–6·7) pharmaceutical personnel. We calculated a global physician density of 16·7 (12·6–21·6) per 10 000 population, and a nurse and midwife density of 38·6 (30·1–48·8) per 10 000 population. We found the GBD super-regions of sub-Saharan Africa, south Asia, and north Africa and the Middle East had the lowest HRH densities. To reach 80 out of 100 on the UHC effective coverage index, we estimated that, per 10 000 population, at least 20·7 physicians, 70·6 nurses and midwives, 8·2 dentistry personnel, and 9·4 pharmaceutical personnel would be needed. In total, the 2019 national health workforces fell short of these minimum thresholds by 6·4 million physicians, 30·6 million nurses and midwives, 3·3 million dentistry personnel, and 2·9 million pharmaceutical personnel. Interpretation: Considerable expansion of the world's health workforce is needed to achieve high levels of UHC effective coverage. The largest shortages are in low-income settings, highlighting the need for increased financing and coordination to train, employ, and retain human resources in the health sector. Actual HRH shortages might be larger than estimated because minimum thresholds for each cadre of health workers are benchmarked on health systems that most efficiently translate human resources into UHC attainment

Mapping 123 million neonatal, infant and child deaths between 2000 and 2017

Since 2000, many countries have achieved considerable success in improving child survival, but localized progress remains unclear. To inform efforts towards United Nations Sustainable Development Goal 3.2—to end preventable child deaths by 2030—we need consistently estimated data at the subnational level regarding child mortality rates and trends. Here we quantified, for the period 2000–2017, the subnational variation in mortality rates and number of deaths of neonates, infants and children under 5 years of age within 99 low- and middle-income countries using a geostatistical survival model. We estimated that 32% of children under 5 in these countries lived in districts that had attained rates of 25 or fewer child deaths per 1,000 live births by 2017, and that 58% of child deaths between 2000 and 2017 in these countries could have been averted in the absence of geographical inequality. This study enables the identification of high-mortality clusters, patterns of progress and geographical inequalities to inform appropriate investments and implementations that will help to improve the health of all populations

Global injury morbidity and mortality from 1990 to 2017 : results from the Global Burden of Disease Study 2017

Correction:Background Past research in population health trends has shown that injuries form a substantial burden of population health loss. Regular updates to injury burden assessments are critical. We report Global Burden of Disease (GBD) 2017 Study estimates on morbidity and mortality for all injuries. Methods We reviewed results for injuries from the GBD 2017 study. GBD 2017 measured injury-specific mortality and years of life lost (YLLs) using the Cause of Death Ensemble model. To measure non-fatal injuries, GBD 2017 modelled injury-specific incidence and converted this to prevalence and years lived with disability (YLDs). YLLs and YLDs were summed to calculate disability-adjusted life years (DALYs). Findings In 1990, there were 4 260 493 (4 085 700 to 4 396 138) injury deaths, which increased to 4 484 722 (4 332 010 to 4 585 554) deaths in 2017, while age-standardised mortality decreased from 1079 (1073 to 1086) to 738 (730 to 745) per 100 000. In 1990, there were 354 064 302 (95% uncertainty interval: 338 174 876 to 371 610 802) new cases of injury globally, which increased to 520 710 288 (493 430 247 to 547 988 635) new cases in 2017. During this time, age-standardised incidence decreased non-significantly from 6824 (6534 to 7147) to 6763 (6412 to 7118) per 100 000. Between 1990 and 2017, age-standardised DALYs decreased from 4947 (4655 to 5233) per 100 000 to 3267 (3058 to 3505). Interpretation Injuries are an important cause of health loss globally, though mortality has declined between 1990 and 2017. Future research in injury burden should focus on prevention in high-burden populations, improving data collection and ensuring access to medical care.Peer reviewe

The global burden of cancer attributable to risk factors, 2010-19 : a systematic analysis for the Global Burden of Disease Study 2019

Background Understanding the magnitude of cancer burden attributable to potentially modifiable risk factors is crucial for development of effective prevention and mitigation strategies. We analysed results from the Global Burden of Diseases, Injuries, and Risk Factors Study (GBD) 2019 to inform cancer control planning efforts globally. Methods The GBD 2019 comparative risk assessment framework was used to estimate cancer burden attributable to behavioural, environmental and occupational, and metabolic risk factors. A total of 82 risk-outcome pairs were included on the basis of the World Cancer Research Fund criteria. Estimated cancer deaths and disability-adjusted life-years (DALYs) in 2019 and change in these measures between 2010 and 2019 are presented. Findings Globally, in 2019, the risk factors included in this analysis accounted for 4.45 million (95% uncertainty interval 4.01-4.94) deaths and 105 million (95.0-116) DALYs for both sexes combined, representing 44.4% (41.3-48.4) of all cancer deaths and 42.0% (39.1-45.6) of all DALYs. There were 2.88 million (2.60-3.18) risk-attributable cancer deaths in males (50.6% [47.8-54.1] of all male cancer deaths) and 1.58 million (1.36-1.84) risk-attributable cancer deaths in females (36.3% [32.5-41.3] of all female cancer deaths). The leading risk factors at the most detailed level globally for risk-attributable cancer deaths and DALYs in 2019 for both sexes combined were smoking, followed by alcohol use and high BMI. Risk-attributable cancer burden varied by world region and Socio-demographic Index (SDI), with smoking, unsafe sex, and alcohol use being the three leading risk factors for risk-attributable cancer DALYs in low SDI locations in 2019, whereas DALYs in high SDI locations mirrored the top three global risk factor rankings. From 2010 to 2019, global risk-attributable cancer deaths increased by 20.4% (12.6-28.4) and DALYs by 16.8% (8.8-25.0), with the greatest percentage increase in metabolic risks (34.7% [27.9-42.8] and 33.3% [25.8-42.0]). Interpretation The leading risk factors contributing to global cancer burden in 2019 were behavioural, whereas metabolic risk factors saw the largest increases between 2010 and 2019. Reducing exposure to these modifiable risk factors would decrease cancer mortality and DALY rates worldwide, and policies should be tailored appropriately to local cancer risk factor burden. Copyright (C) 2022 The Author(s). Published by Elsevier Ltd. This is an Open Access article under the CC BY 4.0 license.Peer reviewe

Tracking development assistance for health and for COVID-19: a review of development assistance, government, out-of-pocket, and other private spending on health for 204 countries and territories, 1990-2050

Background The rapid spread of COVID-19 renewed the focus on how health systems across the globe are financed, especially during public health emergencies. Development assistance is an important source of health financing in many low-income countries, yet little is known about how much of this funding was disbursed for COVID-19. We aimed to put development assistance for health for COVID-19 in the context of broader trends in global health financing, and to estimate total health spending from 1995 to 2050 and development assistance for COVID-19 in 2020. Methods We estimated domestic health spending and development assistance for health to generate total health-sector spending estimates for 204 countries and territories. We leveraged data from the WHO Global Health Expenditure Database to produce estimates of domestic health spending. To generate estimates for development assistance for health, we relied on project-level disbursement data from the major international development agencies' online databases and annual financial statements and reports for information on income sources. To adjust our estimates for 2020 to include disbursements related to COVID-19, we extracted project data on commitments and disbursements from a broader set of databases (because not all of the data sources used to estimate the historical series extend to 2020), including the UN Office of Humanitarian Assistance Financial Tracking Service and the International Aid Transparency Initiative. We reported all the historic and future spending estimates in inflation-adjusted 2020 US$, 2020 US$ per capita, purchasing-power parity-adjusted US$per capita, and as a proportion of gross domestic product. We used various models to generate future health spending to 2050. Findings In 2019, health spending globally reached$8. 8 trillion (95% uncertainty interval UI] 8.7-8.8) or $1132 (1119-1143) per person. Spending on health varied within and across income groups and geographical regions. Of this total,$40.4 billion (0.5%, 95% UI 0.5-0.5) was development assistance for health provided to low-income and middle-income countries, which made up 24.6% (UI 24.0-25.1) of total spending in low-income countries. We estimate that $54.8 billion in development assistance for health was disbursed in 2020. Of this,$13.7 billion was targeted toward the COVID-19 health response. $12.3 billion was newly committed and$1.4 billion was repurposed from existing health projects. $3.1 billion (22.4$2.4 billion (17.9%) was for supply chain and logistics. Only $714.4 million (7.7$1519 (1448-1591) per person in 2050, although spending across countries is expected to remain varied. Interpretation Global health spending is expected to continue to grow, but remain unequally distributed between countries. We estimate that development organisations substantially increased the amount of development assistance for health provided in 2020. Continued efforts are needed to raise sufficient resources to mitigate the pandemic for the most vulnerable, and to help curtail the pandemic for all. Copyright (C) 2021 The Author(s). Published by Elsevier Ltd