# On the Design of Campus Parking Systems with QoS guarantees

arXiv: https://arxiv.org/abs/1506.02818 · HTML: https://mlsanity.com/paper/1506.02818/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 9 Jun 2015.

## Built on by (most cited first, 2 of 2)

- [Multi-resource allocation for federated settings: A non-homogeneous Markov chain model](https://mlsanity.com/paper/2104.12828/) (2021)
- [Near-optimal Differentially Private Client Selection in Federated Settings](https://mlsanity.com/paper/2310.09370/) (2023)

## Abstract (arXiv)

Parking spaces are resources that can be pooled together and shared, especially when there are complementary day-time and night-time users. We answer two design questions. First, given a quality of service requirement, how many spaces should be set aside as contingency during day-time for night-time users? Next, how can we replace the first-come-first-served access method by one that aims at optimal efficiency while keeping user preferences private?