2016
DOI: 10.1109/tits.2015.2503598
|View full text |Cite
|
Sign up to set email alerts
|

On the Design of Campus Parking Systems With QoS Guarantees

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?

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

1
39
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 37 publications
(40 citation statements)
references
References 16 publications
1
39
0
Order By: Relevance
“…More generally, techniques to enforce compliance with social contracts are a fundamental part of any sharing economy system. The design of shared systems is both topical from a practical and theoretical perspective [5], [6]. Analytic issues associated with developing parctical sharing systems include the following basic questions.…”
Section: Distributed Ledger Technology For Smart Cities Thementioning
confidence: 99%
“…More generally, techniques to enforce compliance with social contracts are a fundamental part of any sharing economy system. The design of shared systems is both topical from a practical and theoretical perspective [5], [6]. Analytic issues associated with developing parctical sharing systems include the following basic questions.…”
Section: Distributed Ledger Technology For Smart Cities Thementioning
confidence: 99%
“…In this way, it is possible to take into account the different needs of single MGs, namely, their utility functions. It can be proven that the unsynchronized version of the AIMD can be used to obtain convergence of the long-term average state to the optimal point of a particular class of optimization problems, called optimal resource allocation problems [18]. In particular, if we consider the long-term average of the state variables P si (t)…”
Section: Aimd Algorithmmentioning
confidence: 99%
“…For further details on this subject we refer the interested reader to [18] and [33]. Finally, both centralized and decentralized versions of AIMD may be implemented, depending on whether global or local frequencies are used to give rise to CEs:…”
Section: Aimd Algorithmmentioning
confidence: 99%
See 2 more Smart Citations