{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T12:59:47Z","timestamp":1772197187202,"version":"3.50.1"},"reference-count":54,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.tcs.2026.115790","type":"journal-article","created":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T16:24:40Z","timestamp":1769790280000},"page":"115790","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Attaining equilibria using control sets"],"prefix":"10.1016","volume":"1068","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5260-7811","authenticated-orcid":false,"given":"Gleb","family":"Polevoy","sequence":"first","affiliation":[]},{"given":"Jonas","family":"Schweichhart","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.tcs.2026.115790_bib0001","doi-asserted-by":"crossref","first-page":"286","DOI":"10.2307\/1969529","article-title":"Non-Cooperative games","volume":"54","author":"Nash","year":"1951","journal-title":"Ann. Math."},{"key":"10.1016\/j.tcs.2026.115790_bib0002","series-title":"The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.65109\/TPGA3593","article-title":"Designing incentives for Boolean games","author":"Endriss","year":"2011"},{"key":"10.1016\/j.tcs.2026.115790_bib0003","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1613\/jair.1231","article-title":"K-Implementation","volume":"21","author":"Monderer","year":"2004","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"10.1016\/j.tcs.2026.115790_bib0004","series-title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI-22","first-page":"447","article-title":"Fair, individually rational and cheap adjustment","author":"Polevoy","year":"2022"},{"issue":"2","key":"10.1016\/j.tcs.2026.115790_bib0005","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1137\/S0097539701397059","article-title":"Stackelberg scheduling strategies","volume":"33","author":"Roughgarden","year":"2004","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.115790_bib0006","series-title":"Algorithms \u2013 ESA 2007","first-page":"299","article-title":"Stackelberg strategies for atomic congestion games","author":"Fotakis","year":"2007"},{"key":"10.1016\/j.tcs.2026.115790_bib0007","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1080\/15427951.2012.727772","article-title":"Stackelberg strategies for network design games","volume":"9","author":"Fanelli","year":"2010","journal-title":"Internet Math."},{"key":"10.1016\/j.tcs.2026.115790_bib0008","series-title":"Stackelberg routing on horizontal queueing networks","author":"Krichene","year":"2012"},{"key":"10.1016\/j.tcs.2026.115790_bib0009","series-title":"Stackelberg Routing on Parallel Transportation Networks","first-page":"1","author":"Krichene","year":"2017"},{"key":"10.1016\/j.tcs.2026.115790_bib0010","series-title":"Improved Equilibria via Public Service Advertising","first-page":"728","author":"Balcan","year":"2009"},{"issue":"1","key":"10.1016\/j.tcs.2026.115790_bib0011","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1137\/110821317","article-title":"Circumventing the price of anarchy: leading dynamics to good behavior","volume":"42","author":"Balcan","year":"2013","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.115790_bib0012","series-title":"The Tipping Point: How Little Things Can Make a Big Difference","author":"Gladwell","year":"2006"},{"issue":"1","key":"10.1016\/j.tcs.2026.115790_bib0013","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1257\/mic.2.1.86","article-title":"Social reinforcement: cascades, entrapment, and tipping","volume":"2","author":"Heal","year":"2010","journal-title":"Am. Econ. J. Microecon."},{"key":"10.1016\/j.tcs.2026.115790_bib0014","series-title":"Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"137","article-title":"Maximizing the spread of influence through a social network","author":"Kempe","year":"2003"},{"issue":"3","key":"10.1016\/j.tcs.2026.115790_bib0015","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1007\/s00182-016-0560-8","article-title":"Coordination games on graphs","volume":"46","author":"Apt","year":"2017","journal-title":"Int. J. Game Theory"},{"key":"10.1016\/j.tcs.2026.115790_bib0016","series-title":"Combinatorial Optimization and Applications","first-page":"439","article-title":"Attaining equilibria using control sets","author":"Polevoy","year":"2025"},{"issue":"3","key":"10.1016\/j.tcs.2026.115790_bib0017","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1287\/moor.1110.0500","article-title":"Flows and decompositions of games: harmonic and potential games","volume":"36","author":"Candogan","year":"2011","journal-title":"Math. Oper. Res."},{"issue":"2","key":"10.1016\/j.tcs.2026.115790_bib0018","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1080\/0022250X.1971.9989794","article-title":"Dynamic models of segregation\u2020","volume":"1","author":"Schelling","year":"1971","journal-title":"J. Math. Sociol."},{"key":"10.1016\/j.tcs.2026.115790_bib0019","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/j.procs.2012.09.094","article-title":"An approximation algorithm for computing a tipping set in super modular games for interdependent security","volume":"12","author":"Cremeans","year":"2012","journal-title":"Procedia Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115790_bib0020","series-title":"Proceedings of the 8th ACM Conference on Electronic Commerce","first-page":"93","article-title":"Stackelberg thresholds in network routing games or the value of altruism","author":"Sharma","year":"2007"},{"issue":"1","key":"10.1016\/j.tcs.2026.115790_bib0021","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1109\/90.554730","article-title":"Achieving network optima using Stackelberg routing strategies","volume":"5","author":"Korilis","year":"1997","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"4","key":"10.1016\/j.tcs.2026.115790_bib0022","doi-asserted-by":"crossref","DOI":"10.1145\/2597890","article-title":"Near-Optimality in covering games by exposing global information","volume":"2","author":"Balcan","year":"2014","journal-title":"ACM Trans. Econ. Comput."},{"issue":"4","key":"10.1016\/j.tcs.2026.115790_bib0023","doi-asserted-by":"crossref","first-page":"1823","DOI":"10.1109\/TCNS.2020.3002426","article-title":"Control of learning in anticoordination network games","volume":"7","author":"Eksin","year":"2020","journal-title":"IEEE Trans. Control Network Syst."},{"issue":"1","key":"10.1016\/j.tcs.2026.115790_bib0024","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1111\/1467-937X.00121","article-title":"Contagion","volume":"67","author":"Morris","year":"2000","journal-title":"Rev. Econ. Stud."},{"key":"10.1016\/j.tcs.2026.115790_bib0025","series-title":"The Strategy of Conflict: With a New Preface by the Author","author":"Schelling","year":"1980"},{"key":"10.1016\/j.tcs.2026.115790_bib0026","unstructured":"E. Kalai, Viable nash equilibria: formation and defection, (2020). Preprint, Northwestern University, February."},{"key":"10.1016\/j.tcs.2026.115790_bib0027","doi-asserted-by":"crossref","unstructured":"A. Tauman, E. Kalai, Beyond dominance and nash: ranking equilibria by critical mass, 144(2024). 378\u2013394.","DOI":"10.1016\/j.geb.2024.01.011"},{"key":"10.1016\/j.tcs.2026.115790_bib0028","series-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing","first-page":"53","article-title":"Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation","author":"Abraham","year":"2006"},{"key":"10.1016\/j.tcs.2026.115790_bib0029","series-title":"Viable Nash Equilibria: an Experiment","author":"Kim","year":"2022"},{"key":"10.1016\/j.tcs.2026.115790_bib0030","series-title":"Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing","first-page":"1","article-title":"Completeness theorems for non-Cryptographic fault-Tolerant distributed computation","author":"Ben-Or","year":"1988"},{"issue":"3","key":"10.1016\/j.tcs.2026.115790_bib0031","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1111\/1467-937X.t01-1-00023","article-title":"Fault tolerant implementation","volume":"69","author":"Eliaz","year":"2002","journal-title":"Rev. Econ. Stud."},{"key":"10.1016\/j.tcs.2026.115790_bib0032","series-title":"Algorithmic Game Theory","author":"Nisan","year":"2007"},{"issue":"3","key":"10.1016\/j.tcs.2026.115790_bib0033","doi-asserted-by":"crossref","DOI":"10.1145\/1379759.1379762","article-title":"Computing correlated equilibria in multi-Player games","volume":"55","author":"Papadimitriou","year":"2008","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2026.115790_bib0034","series-title":"16. Acceptable Points in General Cooperative n-Person Games","first-page":"287","author":"Aumann","year":"1959"},{"key":"10.1016\/j.tcs.2026.115790_bib0035","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1145\/322154.322157","article-title":"The effect of a connectivity requirement on the complexity of maximum subgraph problems","volume":"26","author":"Yannakakis","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2026.115790_bib0036","series-title":"Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence","first-page":"253","article-title":"Graphical models for game theory","author":"Kearns","year":"2001"},{"key":"10.1016\/j.tcs.2026.115790_bib0037","series-title":"Reducibility among Combinatorial Problems","first-page":"85","author":"Karp","year":"1972"},{"key":"10.1016\/j.tcs.2026.115790_bib0038","series-title":"A Sub-constant Error-probability Low-degree Test, and a Sub-constant Error-probability Pcp Characterization of Np, in: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC \u201997","first-page":"475-484","article-title":"A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP","author":"Raz","year":"1997"},{"issue":"3","key":"10.1016\/j.tcs.2026.115790_bib0039","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. Syst. Sci."},{"issue":"45","key":"10.1016\/j.tcs.2026.115790_bib0040","doi-asserted-by":"crossref","first-page":"4534","DOI":"10.1016\/j.tcs.2009.08.017","article-title":"On the minimum hitting set of bundles problem","volume":"410","author":"Angel","year":"2009","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2026.115790_bib0041","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1007\/s10878-013-9629-5","article-title":"Parameterizations of hitting set of bundles and inverse scope","volume":"29","author":"Damaschke","year":"2015","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2026.115790_bib0042","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0304-0208(08)73101-3","article-title":"A local-ratio theorem for approximating the weighted vertex cover problem","volume":"109","author":"Bar-Yehuda","year":"1985","journal-title":"North-Holland Math. Stud."},{"issue":"5","key":"10.1016\/j.tcs.2026.115790_bib0043","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1145\/502102.502107","article-title":"A unified approach to approximating resource allocation and scheduling","volume":"48","author":"Bar-Noy","year":"2001","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/j.tcs.2026.115790_bib0044","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/1041680.1041683","article-title":"Local ratio: a unified framework for approximation algorithms. in memoriam: shimon even 1935\u20132004","volume":"36","author":"Bar-Yehuda","year":"2004","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"10.1016\/j.tcs.2026.115790_bib0045","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1006\/game.1996.0044","article-title":"Potential games","volume":"14","author":"Monderer","year":"1996","journal-title":"Games Econ. Behav."},{"issue":"3","key":"10.1016\/j.tcs.2026.115790_bib0046","doi-asserted-by":"crossref","first-page":"1400","DOI":"10.1137\/08073617X","article-title":"On the approximability of influence in social networks","volume":"23","author":"Chen","year":"2009","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"10.1016\/j.tcs.2026.115790_bib0047","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation, and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2026.115790_bib0048","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/S0097539793260763","article-title":"Primal-dual rnc approximation algorithms for set cover and covering integer programs","volume":"28","author":"Rajagopalan","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.115790_bib0049","first-page":"322","article-title":"Primal-dual rnc approximation algorithms for set cover and covering integer programs","volume":"28","author":"Rajagopalan","year":"1993","journal-title":"Vol. 28"},{"issue":"1","key":"10.1016\/j.tcs.2026.115790_bib0050","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1006\/game.1996.0027","article-title":"Congestion games with player-specific payoff functions","volume":"13","author":"Milchtaich","year":"1996","journal-title":"Games Econ. Behav."},{"issue":"1","key":"10.1016\/j.tcs.2026.115790_bib0051","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(84)90086-6","article-title":"On approximation problems related to the independent set and vertex cover problems","volume":"9","author":"Bar-Yehuda","year":"1984","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.tcs.2026.115790_bib0052","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.artint.2008.10.005","article-title":"Strong mediated equilibrium","volume":"173","author":"Monderer","year":"2009","journal-title":"Artif. Intell."},{"issue":"1","key":"10.1016\/j.tcs.2026.115790_bib0053","article-title":"Approximate equilibrium and incentivizing social coordination","volume":"28","author":"Anshelevich","year":"2014","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"issue":"4","key":"10.1016\/j.tcs.2026.115790_bib0054","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1007\/s003550100152","article-title":"A crash course in implementation theory","volume":"18","author":"Jackson","year":"2001","journal-title":"Soc. Choice Welfare"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000496?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000496?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T12:05:57Z","timestamp":1772193957000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526000496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":54,"alternative-id":["S0304397526000496"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115790","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Attaining equilibria using control sets","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115790","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115790"}}