{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T18:11:17Z","timestamp":1780510277296,"version":"3.54.1"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T00:00:00Z","timestamp":1734307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T00:00:00Z","timestamp":1734307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,12,16]]},"DOI":"10.1109\/cdc56724.2024.10885984","type":"proceedings-article","created":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T18:43:32Z","timestamp":1740595412000},"page":"222-228","source":"Crossref","is-referenced-by-count":4,"title":["Follower Agnostic Learning in Stackelberg Games"],"prefix":"10.1109","author":[{"given":"Chinmay","family":"Maheshwari","sequence":"first","affiliation":[{"name":"UC Berkeley,EECS,CA,United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Cheng","sequence":"additional","affiliation":[{"name":"UC Berkeley,EECS,CA,United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shankar","family":"Sastry","sequence":"additional","affiliation":[{"name":"UC Berkeley,EECS,CA,United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lillian","family":"Ratliff","sequence":"additional","affiliation":[{"name":"UW Seattle,ECE,WA,United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eric","family":"Mazumdar","sequence":"additional","affiliation":[{"name":"Caltech,CMS and Economics,CA,United States"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"arXiv","article-title":"Follower agnostic methods for stackelberg games","author":"Maheshwari","year":"2023","journal-title":"arXiv e-prints"},{"key":"ref2","article-title":"Convergence of learning dynamics in stackelberg games","author":"Fiez","year":"2019","journal-title":"arXiv preprint arXiv:1906.01217"},{"key":"ref3","article-title":"The theory of learning in games","volume":"2","author":"Fudenberg","year":"1998"},{"key":"ref4","article-title":"Learning optimal commitment to overcome insecurity","volume":"27","author":"Blum","year":"2014","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04645-2_23"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012149"},{"key":"ref7","first-page":"25799","article-title":"Sample-efficient learning of stackelberg equilibria in general-sum games","volume":"34","author":"Bai","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref8","first-page":"8971","article-title":"Learning to play sequential games versus unknown opponents","volume":"33","author":"Sessa","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CDC49753.2023.10384262"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2024.3410890"},{"key":"ref11","article-title":"Inducing equilibria via incentives: Simultaneous design-and-play ensures global convergence","author":"Liu","year":"2021","journal-title":"arXiv preprint arXiv:2110.01212"},{"key":"ref12","article-title":"Adaptive incentive design with learning agents","author":"Maheshwari","year":"2024","journal-title":"arXiv preprint arXiv:2405.16716"},{"key":"ref13","article-title":"A constrained optimization approach to bilevel optimization with multiple inner minima","author":"Sow","year":"2022","journal-title":"arXiv preprint arXiv:2203.01123"},{"key":"ref14","article-title":"Bome! bilevel optimization made easy: A simple first-order approach","author":"Ye","year":"2022","journal-title":"arXiv preprint arXiv:2209.08709"},{"key":"ref15","article-title":"On bilevel optimization without lowerlevel strong convexity","author":"Chen","year":"2023","journal-title":"arXiv preprint arXiv:2301.00712"},{"key":"ref16","first-page":"6305","article-title":"A generic firstorder algorithmic framework for bi-level programming beyond lowerlevel singleton","volume-title":"International Conference on Machine Learning","author":"Liu"},{"key":"ref17","first-page":"6882","article-title":"A value-function-based interior-point method for non-convex bi-level optimization","volume-title":"International Conference on Machine Learning","author":"Liu"},{"key":"ref18","first-page":"8662","article-title":"Towards gradient-based bilevel optimization with non-convex followers and beyond","volume":"34","author":"Liu","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref19","first-page":"3748","article-title":"On the iteration complexity of hypergradient computation","volume-title":"International Conference on Machine Learning","author":"Grazzi"},{"key":"ref20","first-page":"1165","article-title":"Forward and reverse gradient-based hyperparameter optimization","volume-title":"International Conference on Machine Learning","author":"Franceschi"},{"key":"ref21","first-page":"737","article-title":"Hyperparameter optimization with approximate gradient","volume-title":"International conference on machine learning","author":"Pedregosa"},{"key":"ref22","article-title":"Bilevel optimization: Convergence analysis and enhanced design. arxiv e-prints, art","author":"Ji","year":"2020","journal-title":"arXiv preprint arXiv:2010.07962"},{"key":"ref23","first-page":"1568","article-title":"Bilevel programming for hyperparameter optimization and meta-learning","volume-title":"International Conference on Machine Learning","author":"Franceschi"},{"key":"ref24","article-title":"Approximation methods for bilevel programming","author":"Ghadimi","year":"2018","journal-title":"arXiv preprint arXiv:1802.02246"},{"key":"ref25","article-title":"On differentiating parameterized argmin and argmax problems with application to bi-level optimization","author":"Gould","year":"2016","journal-title":"arXiv preprint arXiv:1607.05447"},{"key":"ref26","first-page":"1723","article-title":"Truncated backpropagation for bilevel optimization","volume-title":"The 22nd International Conference on Artificial Intelligence and Statistics","author":"Shaban"},{"key":"ref27","article-title":"Finite-dimensional variational inequalities and complementarity problems","author":"Facchinei","year":"2003"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1287\/moor.13.3.421"},{"key":"ref29","article-title":"The traffic assignment problem: models and methods","author":"Patriksson","year":"2015"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0005-1098(96)00149-5"},{"key":"ref31","article-title":"Online convex optimization in the bandit setting: gradient descent without a gradient","author":"Flaxman","year":"2004","journal-title":"arXiv preprint cs\/0408007"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1017\/9781009004282"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"ref35","first-page":"1246","article-title":"Gradient descent only converges to minimizers","volume-title":"Conference on learning theory","author":"Lee"}],"event":{"name":"2024 IEEE 63rd Conference on Decision and Control (CDC)","location":"Milan, Italy","start":{"date-parts":[[2024,12,16]]},"end":{"date-parts":[[2024,12,19]]}},"container-title":["2024 IEEE 63rd Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10885784\/10885785\/10885984.pdf?arnumber=10885984","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T07:23:42Z","timestamp":1740641022000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10885984\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,16]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/cdc56724.2024.10885984","relation":{},"subject":[],"published":{"date-parts":[[2024,12,16]]}}}