{"type":"ScholarlyArticle","title":"Automated Synthesis of Mechanisms","authors":[{"name":"Munyque Mittelmann","slug":"munyque-mittelmann","given":"Munyque","family":"Mittelmann","affiliation":"IRIT -Université Toulouse; Capitole , France"},{"name":"Bastien Maubert","slug":"bastien-maubert","given":"Bastien","family":"Maubert","affiliation":"Università degli Studi di Napoli \"Federico II\" , Italy"},{"name":"Aniello Murano","slug":"aniello-murano","given":"Aniello","family":"Murano","affiliation":"Università degli Studi di Napoli \"Federico II\" , Italy"},{"name":"Laurent Perrussel","slug":"laurent-perrussel","given":"Laurent","family":"Perrussel","affiliation":"IRIT -Université Toulouse; Capitole , France"}],"abstract":"Mechanism Design aims to design a game so that a desirable outcome is reached regardless of agents' self-interests. In this paper, we show how this problem can be rephrased as a synthesis problem, where mechanisms are automatically synthesized from a partial or complete specification in a high-level logical language. We show that Quantitative Strategy Logic is a perfect candidate for specifying mechanisms as it can express complex strategic and quantitative properties. We solve automated mechanism design in two cases: when the number of actions is bounded, and when agents play in turn.","doi":"10.24963/ijcai.2022/61","url":"https://ijcai.org/proceedings/2022/61","pdf":"https://ijcai.org/proceedings/2022/0061.pdf","markdown":"https://ijcai.org/proceedings/2022/61.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/61","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Agent-based and Multi-agent Systems","track":"Main Track","number":61,"pages":{"first":426,"last":432},"keywords":["Agent-based and Multi-agent Systems: Formal Verification, Validation and Synthesis","Agent-based and Multi-agent Systems: Mechanism Design"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38986881","length_sec":80,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38985024","length_sec":302,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Ågotnes et al., 2007] T. Ågotnes, W. Van Der Hoek, J. A. Rodríguez-Aguilar, C. Sierra, and M. J. Wooldridge. On the logic of normative systems. In IJCAI, 2007.","title":"On the logic of normative systems","authors":"T Ågotnes, W Van Der Hoek, J A Rodríguez-Aguilar, C Sierra, M J Wooldridge","year":"2007","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2007/190"},{"position":2,"raw":"[Alur et al., 2002] R. Alur, T.A. Henzinger, and O. Kupfer- man. Alternating-time temporal logic. J. ACM, 49(5):672- 713, 2002.","title":"Alternating-time temporal logic","authors":"R Alur, T A Henzinger, O Kupferman","year":"2002","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Asselin et al., 2006] F. Asselin, B. Jaumard, and A. Non- gaillard. A technique for large automated mechanism de- sign problems. In IAT, 2006.","title":"Nongaillard. A technique for large automated mechanism design problems","authors":"F Asselin, B Jaumard, A","year":"2006","venue":"IAT","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Belardinelli et al., 2019] F. Belardinelli, W. Jamroga, D. Kurpiewski, V. Malvone, and A. Murano. Strategy logic with simple goals: Tractable reasoning about strategies. In IJCAI, 2019.","title":"Strategy logic with simple goals: Tractable reasoning about strategies","authors":"F Belardinelli, W Jamroga, D Kurpiewski, V Malvone, A Murano","year":"2019","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2019/13"},{"position":5,"raw":"[Bouyer et al., 2019] P.Bouyer, O.Kupferman, N.Markey, B. Maubert, A.Murano, and G.Perelli. Reasoning about qua- lity and fuzziness of strategic behaviours. In IJCAI, 2019.","title":"Reasoning about quality and fuzziness of strategic behaviours","authors":"P Bouyer, O Kupferman, N Markey, B Maubert, A Murano, G Perelli","year":"2019","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2019/220"},{"position":6,"raw":"[Bulling and Dastani, 2016] N. Bulling and M. Dastani. Norm-based mechanism design. Artificial Intelligence, 239:97-142, 2016.","title":"Norm-based mechanism design","authors":"N Bulling, M Dastani","year":"2016","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Cermák et al., 2015] P. Cermák, A. Lomuscio, and A. Mura- no. Verifying and synthesising multi-agent systems against one-goal strategy logic specifications. In AAAI, 2015.","title":"Verifying and synthesising multi-agent systems against one-goal strategy logic specifications","authors":"P Cermák, A Lomuscio, A Murano","year":"2015","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Chatterjee et al., 2010] K. Chatterjee, T. A. Henzinger, and N. Piterman. Strategy Logic. Inf. Comput., 208(6):677- 693, 2010.","title":"Strategy Logic","authors":"K Chatterjee, T A Henzinger, N Piterman","year":"2010","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Clarke et al., 2018] E.M.Clarke, O.Grumberg, D.Kroening, D. Peled, and H. Veith. Model checking. MIT press, 2018.","title":"Model checking","authors":"E M Clarke, O Grumberg, D Kroening, D Peled, H Veith","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[David and Kroening, 2017] C. David and D. Kroening. Pro- gram synthesis: challenges and opportunities. Phil. Trans. Royal Society A, 375(2104):20150403, 2017.","title":"Program synthesis: challenges and opportunities","authors":"C David, D Kroening","year":"2017","venue":"Phil. Trans. Royal Society A","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Dütting et al., 2019] P. Dütting, Z. Feng, H. Narasimhan, D. Parkes, and S. S. Ravindranath. Optimal auctions through deep learning. In ICML, 2019.","title":"Optimal auctions through deep learning","authors":"P Dütting, Z Feng, H Narasimhan, D Parkes, S S Ravindranath","year":"2019","venue":"ICML","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[French, 2003] T. French. Quantified propositional temporal logic with repeating states. In TIME, 2003.","title":"Quantified propositional temporal logic with repeating states","authors":"T French","year":"2003","venue":"TIME","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"J. R. Green and J. J. Laffont. In- centives in Public Decision Making. North-Holland, Am- sterdam, 1979.","title":"Incentives in Public Decision Making","authors":"J R Green, J J Laffont","year":"1979","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Gutierrez et al., 2019] J. Gutierrez, M. Najib, G. Perelli, and M. J. Wooldridge. Equilibrium design for concurrent games. In CONCUR, 2019.","title":"Equilibrium design for concurrent games","authors":"J Gutierrez, M Najib, G Perelli, M J Wooldridge","year":"2019","venue":"CONCUR","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Klemperer, 1999] P. Klemperer. Auction theory: A guide to the literature. Journal of Economic Surveys, 13(3):227- 286, 1999.","title":"Auction theory: A guide to the literature","authors":"P Klemperer","year":"1999","venue":"Journal of Economic Surveys","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Laroussinie and Markey, 2014] F. Laroussinie and N. Mar- key. Quantified CTL: expressiveness and complexity. Log. Methods Comput. Sci., 10(4), 2014.","title":"Quantified CTL: expressiveness and complexity","authors":"F Laroussinie, N Markey","year":"2014","venue":"Log. Methods Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Laroussinie and Markey, 2015] F. Laroussinie and N. Mar- key. Augmenting ATL with strategy contexts. Inf. Com- put., 245:98-123, 2015.","title":"Augmenting ATL with strategy contexts","authors":"F Laroussinie, N Markey","year":"2015","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Maubert et al., 2021] B. Maubert, M. Mittelmann, A. Mu- rano, and L. Perrussel. Strategic reasoning in automated mechanism design. In KR, 2021. [Mittelmann and Perrussel, 2020]","title":"Strategic reasoning in automated mechanism design","authors":"B Maubert, M Mittelmann, A Murano, L Perrussel","year":"2020","venue":"Mittelmann and Perrussel","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"M. Mittelmann and L. Perrussel. Auction description language (ADL): a gen- eral framework for representing auction-based markets. In ECAI, 2020.","title":"Auction description language (ADL): a general framework for representing auction-based markets","authors":"M Mittelmann, L Perrussel","year":"2020","venue":"ECAI","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Mogavero et al., 2014] F. Mogavero, A. Murano, G. Perelli, and M. Y. Vardi. Reasoning about strategies: On the model-checking problem. ACM Trans. Comput. Log., 15(4), 2014.","title":"Reasoning about strategies: On the model-checking problem","authors":"F Mogavero, A Murano, G Perelli, M Y Vardi","year":"2014","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Mogavero et al., 2017] F. Mogavero, A. Murano, G. Perelli, and M. Y. Vardi. Reasoning about strategies: on the satisfi- ability problem. Log. Methods Comput. Sci., 13(1), 2017.","title":"Reasoning about strategies: on the satisfiability problem","authors":"F Mogavero, A Murano, G Perelli, M Y Vardi","year":"2017","venue":"Log. Methods Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Myerson and Satterthwaite, 1983] R. B. Myerson and M. A. Satterthwaite. Efficient mechanisms for bilateral trading. Journal of Economic Theory, 29(2):265-281, 1983.","title":"Efficient mechanisms for bilateral trading","authors":"R B Myerson, M A Satterthwaite","year":"1983","venue":"Journal of Economic Theory","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Narasimhan et al., 2016] H. Narasimhan, S. B. Agarwal, and D. C. Parkes. Automated mechanism design without money via machine learning. In IJCAI, 2016.","title":"Automated mechanism design without money via machine learning","authors":"H Narasimhan, S B Agarwal, D C Parkes","year":"2016","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/68"},{"position":24,"raw":"[Nisan et al., 2007] N. Nisan, T. Roughgarden, É. Tardos, and V. Vazirani. Algorithmic Game Theory. Cambridge University Press, 2007.","title":"Algorithmic Game Theory","authors":"N Nisan, T Roughgarden, É Tardos, V Vazirani","year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Niu et al., 2012] J. Niu, K. Cai, S. Parsons, M. Fasli, and X. Yao. A grey-box approach to automated mechanism design. Elec. Com. Research and App., 11(1):24-35, 2012.","title":"A grey-box approach to automated mechanism design","authors":"J Niu, K Cai, S Parsons, M Fasli, X Yao","year":"2012","venue":"Elec. Com. Research and App","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Okada et al., 2019] N. Okada, T. Todo, and M. Yokoo. Sat- based automated mechanism design for false-name-proof facility location. In PRIMA, 2019.","title":"Satbased automated mechanism design for false-name-proof facility location","authors":"N Okada, T Todo, M Yokoo","year":"2019","venue":"PRIMA","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Parkes, 2001] D. Parkes. Iterative combinatorial auctions: Achieving economic and computational efficiency. Univ. of Pennsylvania Philadelphia, 2001.","title":"Iterative combinatorial auctions: Achieving economic and computational efficiency","authors":"D Parkes","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Pauly and Wooldridge, 2003] M. Pauly and M. Wooldridge. Logic for mechanism design-a manifesto. In Workshop on Game Theory and Decision Theory in Agent Syst., 2003.","title":"Logic for mechanism design-a manifesto","authors":"M Pauly, M Wooldridge","year":"2003","venue":"Workshop on Game Theory and Decision Theory in Agent Syst","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Pin, 2021] Jean-Éric Pin. Handbook of Automata Theory. European Math. Society Publis. House, Zuerich, 2021.","title":"Handbook of Automata Theory","authors":"Jean-Éric Pin","year":"2021","venue":"European Math","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Pnueli and Rosner, 1989] A. Pnueli and R. Rosner. On the synthesis of a reactive module. In POPL, 1989.","title":"On the synthesis of a reactive module","authors":"Rosner Pnueli, ] A Pnueli, R Rosner","year":"1989","venue":"POPL","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Sandholm, 2003] T. Sandholm. Automated mechanism de- sign: A new application area for search algorithms. In CP, 2003.","title":"Automated mechanism design: A new application area for search algorithms","authors":"T Sandholm","year":"2003","venue":null,"doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Shen et al., 2019] W. Shen, P. Tang, and S. Zuo. Automated mechanism design via neural networks. In AAMAS, 2019.","title":"Automated mechanism design via neural networks","authors":"W Shen, P Tang, S Zuo","year":"2019","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Troquard and Walther, 2012] N. Troquard and D. Walther. On satisfiability in ATL with strategy contexts. In JELIA, 2012.","title":"On satisfiability in ATL with strategy contexts","authors":"N Troquard, D Walther","year":"2012","venue":"JELIA","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Vorobeychik et al., 2007] Y. Vorobeychik, D. M. Reeves, and M. P. Wellman. Constrained automated mechanism design for infinite games of incomplete information. In UAI, 2007.","title":"Constrained automated mechanism design for infinite games of incomplete information","authors":"Y Vorobeychik, D M Reeves, M P Wellman","year":"2007","venue":"UAI","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Wooldridge et al., 2007] M. Wooldridge, T. Agotnes, P. Dunne, and W. Van der Hoek. Logic for automated mechanism design-a progress report. In AAAI, 2007.","title":"Logic for automated mechanism design-a progress report","authors":"M Wooldridge, T Agotnes, P Dunne, W Van Der Hoek","year":"2007","venue":"AAAI","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}