{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T17:42:21Z","timestamp":1772300541036,"version":"3.50.1"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2017,10,11]],"date-time":"2017-10-11T00:00:00Z","timestamp":1507680000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2017,10,11]]},"abstract":"<jats:p>Many real-world control systems, such as the smart grid and software defined networks, have decentralized components that react quickly using local information and centralized components that react slowly using a more global view. This work seeks to provide a theoretical framework for how to design controllers that are decomposed across timescales in this way. The framework is analogous to how the network utility maximization framework uses optimization decomposition to distribute a global control problem across independent controllers, each of which solves a local problem; except our goal is to decompose a global problem temporally, extracting a timescale separation. Our results highlight that decomposition of a multi-timescale controller into a fast timescale, reactive controller and a slow timescale, predictive controller can be near-optimal in a strong sense. In particular, we exhibit such a design, named Multi-timescale Reflexive Predictive Control (MRPC), which maintains a per-timestep cost within a constant factor of the offline optimal in an adversarial setting.<\/jats:p>","DOI":"10.1145\/3152042.3152052","type":"journal-article","created":{"date-parts":[[2017,10,12]],"date-time":"2017-10-12T12:52:50Z","timestamp":1507812770000},"page":"27-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Thinking Fast and Slow"],"prefix":"10.1145","volume":"45","author":[{"given":"Gautam","family":"Goel","sequence":"first","affiliation":[{"name":"California Institute of Technology"}]},{"given":"Niangjun","family":"Chen","sequence":"additional","affiliation":[{"name":"California Institute of Technology"}]},{"given":"Adam","family":"Wierman","sequence":"additional","affiliation":[{"name":"California Institute of Technology"}]}],"member":"320","published-online":{"date-parts":[[2017,10,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7402081"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.887322"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"G. Goel N. Chen and A. Wierman. Thinking Fast and Slow: Optimization Decomposition Across Timescales. arXiv:1704.07785 Apr. 2017.  G. Goel N. Chen and A. Wierman. Thinking Fast and Slow: Optimization Decomposition Across Timescales. arXiv:1704.07785 Apr. 2017.","DOI":"10.1109\/CDC.2017.8263834"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2371999"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"S. H. Low F. Paganini and J. C. Doyle. Internet congestion control. IEEE control systems 22(1):28--43 2002.  S. H. Low F. Paganini and J. C. Doyle. Internet congestion control. IEEE control systems 22(1):28--43 2002.","DOI":"10.1109\/37.980245"},{"key":"e_1_2_1_6_1","volume-title":"John Wiley & Sons","author":"Masters G. M.","year":"2013"},{"key":"e_1_2_1_7_1","volume-title":"Springer Science & Business Media","author":"Sontag E. D.","year":"2013"},{"key":"e_1_2_1_8_1","volume-title":"Springer Science & Business Media","author":"Srikant R.","year":"2012"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3152042.3152052","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3152042.3152052","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:26Z","timestamp":1750213586000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3152042.3152052"}},"subtitle":["Optimization Decomposition Across Timescales"],"short-title":[],"issued":{"date-parts":[[2017,10,11]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,10,11]]}},"alternative-id":["10.1145\/3152042.3152052"],"URL":"https:\/\/doi.org\/10.1145\/3152042.3152052","relation":{},"ISSN":["0163-5999"],"issn-type":[{"value":"0163-5999","type":"print"}],"subject":[],"published":{"date-parts":[[2017,10,11]]},"assertion":[{"value":"2017-10-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}