{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T17:10:14Z","timestamp":1727889014341},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T00:00:00Z","timestamp":1661472000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T00:00:00Z","timestamp":1661472000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["91646204","92046026"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876080","71871109"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71901115"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Research and Development Program of China","award":["2017YFD0401001","2018YFB1403400"]},{"DOI":"10.13039\/501100013058","name":"Jiangsu Provincial Key Research and Development Program","doi-asserted-by":"publisher","award":["BE2019105"],"id":[{"id":"10.13039\/501100013058","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Young Scholar Programme from NUFE","award":["SHLXW19001"]},{"name":"International Cooperation Programme of JiangSu Province","award":["BZ2020008"]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10458-022-09576-4","type":"journal-article","created":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T04:02:52Z","timestamp":1661486572000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Bayesian optimal social law synthesizing mechanism for strategical agents"],"prefix":"10.1007","volume":"36","author":[{"given":"Jun","family":"Wu","sequence":"first","affiliation":[]},{"given":"Jie","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Hongliang","family":"Sun","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2628-7033","authenticated-orcid":false,"given":"Chongjun","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,26]]},"reference":[{"key":"9576_CR1","unstructured":"Shoham, Y., & Tennenholtz, M. (1992). On the synthesis of useful social laws for artificial agent societies. In Proceedings of AAAI-92 (pp. 276\u2013281)."},{"key":"9576_CR2","doi-asserted-by":"crossref","unstructured":"Shoham, Y., & Tennenholtz, M. (1996). On social laws for artificial agent societies: Off-line design. In Agre, P.E., & Rosenschein S.J. (Eds.), Computational theories of interaction and agency (pp. 597\u2013618). MIT Press.","DOI":"10.7551\/mitpress\/2026.003.0017"},{"key":"9576_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11229-006-9072-6","volume":"156","author":"W van der Hoek","year":"2007","unstructured":"van der Hoek, W., Roberts, M., & Wooldridge, M. (2007). Social laws in alternating time: Effectiveness feasibility, and synthesis. Synthese, 156, 1\u201319.","journal-title":"Synthese"},{"key":"9576_CR4","unstructured":"Wu, J., Wang, C., & Xie, J. (2011). A framework for coalitional normative systems. In Proceedings of AAMAS-11."},{"key":"9576_CR5","unstructured":"\u00c5gotnes, T., van der Hoek, W., & Wooldridge, M. (2012). Conservative social laws. In Proceedings of ECAI-12 (pp. 49\u201353)."},{"key":"9576_CR6","doi-asserted-by":"crossref","unstructured":"\u00c5gotnes, T., Wooldridge, M., van der Hoek, W. (2007). Normative system games. In Proceedings of AAMAS-07 (pp. 876\u2013883).","DOI":"10.1145\/1329125.1329284"},{"key":"9576_CR7","unstructured":"Morales, J., Lopez-Sanchez, M., Wooldridge, M., & Vasconcelos, W. (2013). Automated synthesis of normative systems. In Proceedings of AAMAS-13 (pp. 484\u2013490)."},{"key":"9576_CR8","unstructured":"Bulling, N., & Dastani, M. (2011). Verifying normative behaviour via normative mechanism design. In Proceedings of IJCAI-2011 (pp. 103\u2013108)."},{"key":"9576_CR9","unstructured":"\u00c5gotnes, T., & Wooldridge, M. (2010). Optimal social laws. In Proceedings of AAMAS-10 (pp. 667\u2013674)."},{"key":"9576_CR10","doi-asserted-by":"crossref","unstructured":"Nisan, N., & Ronen, A. (1999). Algorithmic mechanism design. In Proceedings of the thirty-first annual ACM symposium on theory of computing (pp. 129\u2013140). ACM.","DOI":"10.1145\/301250.301287"},{"key":"9576_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N Nisan","year":"2001","unstructured":"Nisan, N., & Ronen, A. (2001). Algorithmic mechanism design. Games and Economic Behavior, 35, 129\u2013140.","journal-title":"Games and Economic Behavior"},{"key":"9576_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., & Vazirani, V. V. (2007). Algorithmic Game Theory (Vol. 1). Cambridge University Press."},{"key":"9576_CR13","unstructured":"Archer, A., & Tardos, E. (2002). Frugal path mechanisms. In Proceedings of SODA-02 (pp. 991\u2013999)."},{"key":"9576_CR14","doi-asserted-by":"crossref","unstructured":"Talwar, K. (2003). The price of truth: Frugality in truthful mechanisms. In Proceedings of STACS-03 (pp. 608\u2013619).","DOI":"10.1007\/3-540-36494-3_53"},{"issue":"1","key":"9576_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1186810.1186813","volume":"3","author":"A Archer","year":"2004","unstructured":"Archer, A., & Tardos, E. (2004). Frugal path mechanisms. ACM Transactions on Algorithms, 3(1), 1\u201319.","journal-title":"ACM Transactions on Algorithms"},{"key":"9576_CR16","unstructured":"Elkind, E., Sahai, A., & Steiglitz, K. (2004). Frugality in path auctions. In Proceedings of SODA-04 (pp. 701\u2013709)."},{"key":"9576_CR17","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., & Kempe, D. (2005). Beyond vcg: Frugality of truthful mechanisms. In Proceedings of FOCS-05 (pp. 615\u2013626).","DOI":"10.1109\/SFCS.2005.25"},{"key":"9576_CR18","unstructured":"Zhao, D., Ma, H., & Liu, L. (2014). Frugal online incentive mechanisms for crowdsourcing tasks truthfully. CoRR arXiv:1404.2399."},{"key":"9576_CR19","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.tcs.2014.10.019","volume":"562","author":"G Calinescu","year":"2015","unstructured":"Calinescu, G. (2015). Bounding the payment of approximate truthful mechanisms. Theoretical Computer Science, 562, 419\u2013435.","journal-title":"Theoretical Computer Science"},{"key":"9576_CR20","unstructured":"Zhang, L., Chen, H., Wu, J., Wang, C., & Xie, J. (2016). False-name-proof mechanisms for path auctions in social networks. In Proceedings of ECAI-16 (pp. 1485\u20131492)."},{"key":"9576_CR21","doi-asserted-by":"crossref","unstructured":"Bikhchandani, S., Vries, S., Schummer, J., & Vohra, R.V. (2002) Linear programming and vickrey auctions. In Vohra (Ed.), Mathematics of the internet: E-auction and markets.","DOI":"10.1007\/978-1-4684-9277-4_6"},{"key":"9576_CR22","doi-asserted-by":"crossref","unstructured":"Garg, R., Kumar, V., Rudra, A., & Verma, A. (2002). Coalitional games on graphs: Core structure, substitutes and frugality. Technical Report TR-02-60, UTCS.","DOI":"10.1145\/779928.779982"},{"issue":"1","key":"9576_CR23","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"RB Myerson","year":"1981","unstructured":"Myerson, R. B. (1981). Optimal auction design. Mathematics of Operations Research, 6(1), 58\u201373.","journal-title":"Mathematics of Operations Research"},{"key":"9576_CR24","doi-asserted-by":"crossref","unstructured":"Emerson, E.A. (1990). Temporal and modal logic. In Leeuwen, J.V. (Ed.), Handbook of theoretical computer science (pp. 997\u20131072).","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"9576_CR25","doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., & Shoham, Y. (2008). Essentials of game theory: A concise multidisciplinary introduction. In Synthesis lectures on artificial intelligence & machine learning (pp. 77\u201378). Morgan & Claypool Publishers.","DOI":"10.1007\/978-3-031-01545-8"},{"key":"9576_CR26","doi-asserted-by":"crossref","unstructured":"Singer, Y. (2010). Budget feasible mechanisms. In Proceedings of FOCS-10 (pp. 765\u2013774).","DOI":"10.1109\/FOCS.2010.78"},{"key":"9576_CR27","first-page":"330","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., & Katoen, J. P. (2008). Principles of Model Checking (pp. 330\u2013333). The MIT Press."},{"key":"9576_CR28","doi-asserted-by":"crossref","unstructured":"\u00c5gotnes, T., van\u00a0der Hoek, W., Rodriguez-Aguilar, J. A., Sierra, C., & Wooldridge, M. (2007). On the logic of normative systems. In Proceedings of IJCAI-07 (pp. 1175\u20131180).","DOI":"10.1145\/1329125.1329284"},{"key":"9576_CR29","unstructured":"\u00c5gotnes, T., van der Hoek, W., & Wooldridge, M. (2008). Robust normative systems. In Proceedings of AAMAS-08 (pp. 747\u2013754)."},{"key":"9576_CR30","unstructured":"\u00c5gotnes, T., van der Hoek, W., Tennenholtz, M., & Wooldridge, M. (2009). Power in normative systems. In Proceedings of AAMAS-09 (pp. 145\u2013152)."},{"key":"9576_CR31","doi-asserted-by":"crossref","unstructured":"van der Hoek, W., Roberts, M., & Wooldridge, M. (2005). Knowledge and social laws. In Proceedings of the AAMAS-05, Utrecht, Netherlands (pp. 674\u2013681).","DOI":"10.1145\/1082473.1082576"},{"issue":"6","key":"9576_CR32","doi-asserted-by":"publisher","first-page":"1442","DOI":"10.1109\/TSMCB.2011.2146248","volume":"41","author":"C Wang","year":"2011","unstructured":"Wang, C., Wu, J., Wang, Z., & Xie, J. (2011). Strategic ability updating in concurrent games by coalitional commitment. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 41(6), 1442\u20131457.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)"},{"key":"9576_CR33","volume-title":"Game theory and the social contract, Vol. 1: Playing fair","author":"K Binmore","year":"1994","unstructured":"Binmore, K. (1994). Game theory and the social contract, Vol. 1: Playing fair. The MIT Press."},{"key":"9576_CR34","volume-title":"Game theory and the social contract, Vol. 2: Just playing","author":"K Binmore","year":"1998","unstructured":"Binmore, K. (1998). Game theory and the social contract, Vol. 2: Just playing. The MIT Press."},{"key":"9576_CR35","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.artint.2016.07.001","volume":"239","author":"N Bulling","year":"2016","unstructured":"Bulling, N., & Dastani, M. (2016). Norm-based mechanism design. Artificial Intelligence, 239, 97\u2013142.","journal-title":"Artificial Intelligence"},{"key":"9576_CR36","unstructured":"Dell\u2019Anna, D., Dastani, M., & Dalpiaz, F. (2017). Reasoning about norms revision. In Proceedings of BNAIC-17 (pp. 281\u2013290)."},{"issue":"1\u20132","key":"9576_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(01)00159-X","volume":"135","author":"T Sandholm","year":"2002","unstructured":"Sandholm, T. (2002). Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence, 135(1\u20132), 1\u201354.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"9576_CR38","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey, W. (1961). Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance, 16(1), 8\u201337.","journal-title":"Journal of Finance"},{"issue":"11","key":"9576_CR39","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"EH Clarke","year":"1971","unstructured":"Clarke, E. H. (1971). Multipart pricing of public goods. Public Choice, 11(11), 17\u201333.","journal-title":"Public Choice"},{"key":"9576_CR40","doi-asserted-by":"publisher","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T Groves","year":"1973","unstructured":"Groves, T. (1973). Incentives in teams. Econometrica, 41, 617\u2013631.","journal-title":"Econometrica"},{"key":"9576_CR41","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1613\/jair.2046","volume":"29","author":"N Nisan","year":"2003","unstructured":"Nisan, N., & Ronen, A. (2003). Computationally feasible VCG mechanisms. Journal of Artificial Intelligence Research, 29, 19\u201347.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9576_CR42","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., & Nisan, N. (2007). Limitations of VCG-based mechanisms. In Proceedings of STOC-07 (pp. 338\u2013344).","DOI":"10.1145\/1250790.1250842"},{"key":"9576_CR43","unstructured":"Hartline, J. (2006). Lectures on optimal mechanism design."},{"key":"9576_CR44","doi-asserted-by":"crossref","unstructured":"Wu, J., Qiao, Y., Zhang, L., Wang, C., & Liu, M. (2020). A multi-unit profit competitive mechanism for cellular traffic offloading. In Proceedings of AAAI-2020 (pp. 2294\u20132301).","DOI":"10.1609\/aaai.v34i02.5607"},{"key":"9576_CR45","unstructured":"Wu, J., Zhang, L., Wang, C., & Xie, J. (2017). Synthesizing optimal social laws for strategical agents via Bayesian mechanism design. In Proceedings of AAMAS-17 (pp. 1214\u20131222)."},{"key":"9576_CR46","unstructured":"Wu, J., Zhang, Y., Qiao, Y., Zhang, L., Wang, C., & Xie, J. (2019). Multi-unit budget feasible mechanisms for cellular traffic offloading. In Proceedings of AAMAS-19."},{"key":"9576_CR47","unstructured":"Goldberg, A. V., Hartline, J. D., & Wright, A. (2001). Competitive auctions and digital goods. In Proceedings of SODA-01 (pp. 735\u2013744)."},{"issue":"2","key":"9576_CR48","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.geb.2006.02.003","volume":"55","author":"AV Goldberg","year":"2006","unstructured":"Goldberg, A. V., Hartline, J. D., Karlin, A. R., Saks, M., & Wright, A. (2006). Competitive auctions. Games and Economic Behavior, 55(2), 242\u2013269.","journal-title":"Games and Economic Behavior"},{"key":"9576_CR49","doi-asserted-by":"crossref","unstructured":"Chen, N., Gravin, N., & Lu, P. (2014). Optimal competitive auctions. In Proceedings of STOC-14 (pp. 253\u2013262).","DOI":"10.1145\/2591796.2591855"},{"key":"9576_CR50","unstructured":"Cary, M. C., Flaxman, A. D., Hartline, J. D., & Karlin, A. R. (2008). Auctions for structured procurement. In Proceedings of SODA-08 (pp. 304\u2013313)."},{"key":"9576_CR51","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.A., & Kupferman, O. (1997). Alternating-time temporal logic. In Proceedings of FOCS-97 (pp. 100\u2013109).","DOI":"10.1109\/SFCS.1997.646098"},{"issue":"5","key":"9576_CR52","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R Alur","year":"2002","unstructured":"Alur, R., Henzinger, T. A., & Kupferman, O. (2002). Alternating-time temporal logic. JACM, 49(5), 672\u2013713.","journal-title":"JACM"},{"key":"9576_CR53","unstructured":"Wu, J., Zhang, L., Wang, C., & Xie, J. (2017). Mechanism design for social law synthesis under incomplete information, pp. 1757\u20131759."},{"issue":"8","key":"9576_CR54","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.tcs.2020.09.030","volume":"846","author":"S Bhattacharya","year":"2020","unstructured":"Bhattacharya, S., Koutsoupias, E., Kulkarni, J., Leonardi, S., & Xu, X. (2020). Prior-free multi-unit auctions with ordered bidders. Theoretical Computer Science, 846(8), 160\u2013171.","journal-title":"Theoretical Computer Science"},{"key":"9576_CR55","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1093\/comjnl\/bxx022","volume":"6","author":"C Ying","year":"2017","unstructured":"Ying, C., Huang, H., Ajay, G., & Li, Z. (2017). A prior-free spectrum auction for approximate revenue maximization. Computer Journal, 6, 898\u2013910.","journal-title":"Computer Journal"},{"key":"9576_CR56","doi-asserted-by":"crossref","unstructured":"Liu, D., Hafid, A. S., & Khoukhi, L. (2019). Multi-item auction based mechanism for mobile data offloading: A robust optimization approach. IEEE Transactions on Vehicular Technology, 69(4).","DOI":"10.1109\/TVT.2020.2968354"},{"issue":"2","key":"9576_CR57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10458-021-09522-w","volume":"35","author":"M Guo","year":"2021","unstructured":"Guo, M., Wang, G., Hata, H., & Babar, M. A. (2021). Revenue maximizing markets for zero-day exploits. Autonomous Agents and Multi-Agent Systems, 35(2), 1\u201329.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9576_CR58","doi-asserted-by":"crossref","unstructured":"Cai, Y., & Daskalakis, C. (2017). Learning multi-item auctions with (or without) samples. In Proceedings of FOCS-08 (pp. 234\u2013254).","DOI":"10.1109\/FOCS.2017.54"},{"key":"9576_CR59","unstructured":"Bx, A., & Wei, Y. A. (2020). A Bayesian learning model for estimating unknown demand parameter in revenue management-sciencedirect. European Journal of Operational Research."},{"key":"9576_CR60","unstructured":"D\u00fctting, P., Feng, Z., Narasimhan, H., & Parkes, D. C. (2017). Optimal auctions through deep learning. arXiv preprint arXiv:1706.03459."},{"key":"9576_CR61","unstructured":"Balcan, M.-F. F., Sandholm, T., & Vitercik, E. (2016). Sample complexity of automated mechanism design. In Proceedings of advances in neural information processing systems (pp. 79\u201398)."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-022-09576-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-022-09576-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-022-09576-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T16:34:02Z","timestamp":1727886842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-022-09576-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,26]]},"references-count":61,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["9576"],"URL":"https:\/\/doi.org\/10.1007\/s10458-022-09576-4","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"type":"print","value":"1387-2532"},{"type":"electronic","value":"1573-7454"}],"subject":[],"published":{"date-parts":[[2022,8,26]]},"assertion":[{"value":"5 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"48"}}