{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T11:17:49Z","timestamp":1775042269403,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030859466","type":"print"},{"value":"9783030859473","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85947-3_11","type":"book-chapter","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T00:45:22Z","timestamp":1631580322000},"page":"156-170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Game Theory on the Blockchain: A Model for Games with Smart Contracts"],"prefix":"10.1007","author":[{"given":"Mathias","family":"Hall-Andersen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaj I.","family":"Schwartzbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,14]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Averboukh, Y.: Inverse stackelberg solutions for games with many followers. Mathematics 6 (2014). https:\/\/doi.org\/10.3390\/math6090151","DOI":"10.3390\/math6090151"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Basar, T., Selbuz, H.: Closed-loop stackelberg strategies with applications in the optimal control of multilevel systems. IEEE Trans. Autom. Control AC-24, 166\u2013179 (1979)","DOI":"10.1109\/TAC.1979.1101999"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-53832-1_29","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"HL Bodlaender","year":"1991","unstructured":"Bodlaender, H.L.: On the complexity of some coloring games. In: M\u00f6hring, R.H. (ed.) WG 1990. LNCS, vol. 484, pp. 30\u201340. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-53832-1_29"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Bo\u0161ansk\u00fd, B., Br\u00e2nzei, S., Hansen, K.A., Lund, T.B., Miltersen, P.B.: Computation of stackelberg equilibria of finite sequential games. ACM Trans. Econ. Comput. 5(4) (2017). https:\/\/doi.org\/10.1145\/3133242","DOI":"10.1145\/3133242"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF00939867","volume":"59","author":"M Breton","year":"1988","unstructured":"Breton, M., Alj, A., Haurie, A.: Sequential stackelberg equilibria in two-person games. J. Optim. Theory Appl. 59(1), 71\u201397 (1988). https:\/\/doi.org\/10.1007\/BF00939867","journal-title":"J. Optim. Theory Appl."},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Chen, X., Deng, X.: Settling the complexity of two-player Nash equilibrium. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 261\u2013272 (2006). https:\/\/doi.org\/10.1109\/FOCS.2006.69","DOI":"10.1109\/FOCS.2006.69"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a Nash equilibrium. SIAM J. Comput. 39, 195\u2013259 (2009). https:\/\/doi.org\/10.1137\/070699652","journal-title":"SIAM J. Comput."},{"key":"11_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. (1990)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Ho, Y., Olsder, G.: Aspects of the stackelberg problem \u2013 incentive, bluff, and hierarchy1. IFAC Proc. Vol. 14(2), 1359\u20131363 (1981). 8th IFAC World Congress on Control Science and Technology for the Progress of Society, Kyoto, Japan, 24\u201328 August 1981","DOI":"10.1016\/S1474-6670(17)63667-X"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01586088","volume":"32","author":"RG Jeroslow","year":"1985","unstructured":"Jeroslow, R.G.: The polynomial hierarchy and a simple model for competitive analysis. Math. Program. 32(2), 146\u2013164 (1985). https:\/\/doi.org\/10.1007\/BF01586088","journal-title":"Math. Program."},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/BF00933155","volume":"26","author":"G Leitmann","year":"1978","unstructured":"Leitmann, G.: On generalized stackelberg strategies. J. Optim. Theory Appl. 26(4), 637\u2013643 (1978). https:\/\/doi.org\/10.1007\/BF00933155","journal-title":"J. Optim. Theory Appl."},{"key":"11_CR12","unstructured":"Letchford, J.: Computational aspects of stackelberg games. Ph.D. thesis, Duke University, Durham, NC, USA (2013)"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Letchford, J., Conitzer, V.: Computing optimal strategies to commit to in extensive-form games. In: Proceedings of the 11th ACM Conference on Electronic Commerce, EC 2010, pp. 83\u201392. Association for Computing Machinery, New York (2010). https:\/\/doi.org\/10.1145\/1807342.1807354","DOI":"10.1145\/1807342.1807354"},{"issue":"7","key":"11_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0898-1221(98)00174-6","volume":"36","author":"B Liu","year":"1998","unstructured":"Liu, B.: Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms. Comput. Math. Appl. 36(7), 79\u201389 (1998)","journal-title":"Comput. Math. Appl."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Luh, P.B., Chang, S.C., Chang, T.S.: Brief paper: solutions and properties of multi-stage stackelberg games. Automatica 251\u2013256 (1984)","DOI":"10.1016\/0005-1098(84)90034-7"},{"key":"11_CR16","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. The MIT Press (1994). Electronic edition"},{"issue":"2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1287\/opre.32.2.390","volume":"32","author":"HD Sherali","year":"1984","unstructured":"Sherali, H.D.: A multiple leader stackelberg model and analysis. Oper. Res. 32(2), 390\u2013404 (1984)","journal-title":"Oper. Res."},{"key":"11_CR18","unstructured":"von Stackelberg, H.: Marktform und Gleichgewicht. Verlag von Julius Springer (1934)"},{"key":"11_CR19","unstructured":"Stankova, K.: On Stackelberg and Inverse Stackelberg Games & Their Applications in the Optimal Toll Design Problem, the Energy Market Liberalization Problem, and in the Theory of Incentives. Post-Print hal-00391650, HAL, February 2009"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-40948-6_32","volume-title":"Logic, Rationality, and Interaction","author":"J Szymanik","year":"2013","unstructured":"Szymanik, J.: Backward induction is PTIME-complete. In: Grossi, D., Roy, O., Huang, H. (eds.) LORI 2013. LNCS, vol. 8196, pp. 352\u2013356. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40948-6_32"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/BF00935889","volume":"34","author":"B Tolwinski","year":"1981","unstructured":"Tolwinski, B.: Closed-loop stackelberg solution to a multistage linear-quadratic game. J. Optim. Theory Appl. 34, 484\u2013501 (1981)","journal-title":"J. Optim. Theory Appl."},{"key":"11_CR22","first-page":"1","volume":"151","author":"G Wood","year":"2014","unstructured":"Wood, G.: Ethereum: a secure decentralised generalised transaction ledger. Ethereum Project Yellow Paper 151, 1\u201332 (2014)","journal-title":"Ethereum Project Yellow Paper"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85947-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T14:11:00Z","timestamp":1641996660000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85947-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030859466","9783030859473"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85947-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4 abstracts of presented papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}