pith. sign in

arxiv: 1506.02818 · v1 · pith:FQ4N2OMPnew · submitted 2015-06-09 · 🧮 math.OC

On the Design of Campus Parking Systems with QoS guarantees

classification 🧮 math.OC
keywords day-timedesignnight-timeparkingspacesusersaccessaims
0
0 comments X
read the original abstract

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?

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.