Conference paper
Data-driven distributionally robust polynomial optimization
Martin Mevissen, Emanuele Ragnoli, et al.
NeurIPS 2013
Parking spaces are resources that can be pooled together and shared, particularly when there exist complementary daytime and nighttime users. We provide solutions to two design questions. First, given a quality of service requirement, how many spaces should be set aside as contingency during the day for nighttime users? Next, how can we replace the first-come-first-served access method by one that aims for optimal efficiency while keeping user preferences private?
Martin Mevissen, Emanuele Ragnoli, et al.
NeurIPS 2013
Mingming Liu, Rodrigo Ordonez-Hurtado, et al.
IEEE T-ITS
Nikolaos Panagiotou, Ioannis Katakis, et al.
ASONAM 2016
Matheus Souza, Wynita M. Griggs, et al.
European Journal of Control