{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T15:44:44Z","timestamp":1777563884108,"version":"3.51.4"},"reference-count":184,"publisher":"Springer Science and Business Media LLC","issue":"22","license":[{"start":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T00:00:00Z","timestamp":1684540800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T00:00:00Z","timestamp":1684540800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"R &D project of Guangdong Province","award":["2020B0101380001"],"award-info":[{"award-number":["2020B0101380001"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902093,6187060369,62176164"],"award-info":[{"award-number":["61902093,6187060369,62176164"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science Foundation of Guangdong","award":["2020A1515010652"],"award-info":[{"award-number":["2020A1515010652"]}]},{"name":"PINGAN-HITsz Intelligence Finance Research Center"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s00521-023-08647-1","type":"journal-article","created":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T15:01:56Z","timestamp":1684594916000},"page":"16193-16222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Breaking the traditional: a survey of algorithmic mechanism design applied to economic and complex environments"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2341-2118","authenticated-orcid":false,"given":"Qian","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3512-0649","authenticated-orcid":false,"given":"Xuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zoe Lin","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yulin","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huale","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaozhen","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,20]]},"reference":[{"issue":"4","key":"8647_CR1","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1287\/opre.2013.1187","volume":"61","author":"V Abhishek","year":"2013","unstructured":"Abhishek V, Hosanagar K (2013) Optimal bidding in multi-item multislot sponsored search auctions. Operat Res 61(4):855\u2013873","journal-title":"Operat Res"},{"key":"8647_CR2","doi-asserted-by":"crossref","unstructured":"Abraham DJ, Blum A, Sandholm T (2007) Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. In: Proceedings of the 8th ACM conference on electronic commerce, pp 295\u2013304","DOI":"10.1145\/1250910.1250954"},{"issue":"3","key":"8647_CR3","first-page":"19","volume":"43","author":"G Adomavicius","year":"2018","unstructured":"Adomavicius G, Gupta A, Yang M (2018) Designing real-time feedback for bidders in homogeneous-item continuous combinatorial auctions. MIS Quarterly 43(3):19\u201389","journal-title":"MIS Quarterly"},{"key":"8647_CR4","doi-asserted-by":"crossref","unstructured":"Allen B (1997) Implementation theory with incomplete information. Cooperation: game-theoretic approaches, pp 115\u2013126","DOI":"10.1007\/978-3-642-60454-6_10"},{"key":"8647_CR5","first-page":"22","volume":"17","author":"LM Ausubel","year":"2006","unstructured":"Ausubel LM, Milgrom PR (2006) The lovely but lonely Vickrey auction. Combinatorial Auctions 17:22\u201326","journal-title":"Combinatorial Auctions"},{"key":"8647_CR6","doi-asserted-by":"crossref","unstructured":"Ausubel LM, Cramton P, Deneckere RJ (2002) Bargaining with incomplete information. Handbook of game theory with economic applications, vol 3, pp 1897\u20131945","DOI":"10.1016\/S1574-0005(02)03013-8"},{"key":"8647_CR7","doi-asserted-by":"crossref","unstructured":"Ausubel LM, Cramton P, Milgrom PR (2016) The clock-proxy auction: a practical combinatorial auction design. Handbook of spectrum auction design, vol 1, pp 120\u2013140","DOI":"10.1017\/9781316471609.007"},{"key":"8647_CR8","unstructured":"Awasthi P, Sandholm T (2009) Online stochastic optimization in the large: application to kidney exchange. IJCAI, pp 405\u2013411"},{"key":"8647_CR9","doi-asserted-by":"crossref","unstructured":"Babaioff M, Sharma Y, Slivkins A (2009) Characterizing truthful multi-armed bandit mechanisms. In: Proceedings of the 10th ACM conference on electronic commerce, pp 79\u201388","DOI":"10.1145\/1566374.1566386"},{"key":"8647_CR10","first-page":"25,799","volume":"34","author":"Y Bai","year":"2021","unstructured":"Bai Y, Jin C, Wang H et al (2021) Sample-efficient learning of Stackelberg equilibria in general-sum games. Adv Neural Inf Process Syst 34:25,799-25,811","journal-title":"Adv Neural Inf Process Syst"},{"key":"8647_CR11","doi-asserted-by":"crossref","unstructured":"Barber\u00e0 S (2011) Strategyproof social choice. In: Handbook of social choice and welfare, vol 2, pp 731\u2013831","DOI":"10.1016\/S0169-7218(10)00025-0"},{"issue":"1","key":"8647_CR12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1111\/1467-937X.00164","volume":"68","author":"JP Benoit","year":"2001","unstructured":"Benoit JP, Krishna V (2001) Multiple-object auctions with budget constrained bidders. Rev Econ Stud 68(1):155\u2013179","journal-title":"Rev Econ Stud"},{"issue":"2","key":"8647_CR13","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1257\/jel.20180892","volume":"57","author":"D Bergemann","year":"2019","unstructured":"Bergemann D, V\u00e4lim\u00e4ki J (2019) Dynamic mechanism design: an introduction. J Econ Lit 57(2):235\u201374","journal-title":"J Econ Lit"},{"issue":"7","key":"8647_CR14","first-page":"2217","volume":"69","author":"M Bichler","year":"2022","unstructured":"Bichler M, Milgrom P, Schwarz G (2022) Taming the communication and computation complexity of combinatorial auctions: the fuel bid language. Manag Sci 69(4):2217\u20132238","journal-title":"Manag Sci"},{"key":"8647_CR15","unstructured":"Bolton P, Dewatripont M (2004) Contract theory. MIT press"},{"issue":"6218","key":"8647_CR16","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1126\/science.1259433","volume":"347","author":"M Bowling","year":"2015","unstructured":"Bowling M, Burch N, Johanson M et al (2015) Heads-up limit hold\u2019em poker is solved. Science 347(6218):145\u2013149","journal-title":"Science"},{"key":"8647_CR17","doi-asserted-by":"crossref","unstructured":"Brero G, Eden A, Gerstgrasser M et\u00a0al (2021) Reinforcement learning of sequential price mechanisms. AAAI Press, pp 5219\u20135227","DOI":"10.1609\/aaai.v35i6.16659"},{"issue":"6374","key":"8647_CR18","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1126\/science.aao1733","volume":"359","author":"N Brown","year":"2018","unstructured":"Brown N, Sandholm T (2018) Superhuman ai for heads-up no-limit poker: Libratus beats top professionals. Science 359(6374):418\u2013424","journal-title":"Science"},{"issue":"6456","key":"8647_CR19","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1126\/science.aay2400","volume":"365","author":"N Brown","year":"2019","unstructured":"Brown N, Sandholm T (2019) Superhuman ai for multiplayer poker. Science 365(6456):885\u2013890","journal-title":"Science"},{"issue":"3","key":"8647_CR20","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/s10878-010-9297-7","volume":"23","author":"TM Bu","year":"2012","unstructured":"Bu TM, Deng X, Qi Q (2012) Multi-bidding strategy in sponsored search auctions. J Comb Optim 23(3):356\u2013372","journal-title":"J Comb Optim"},{"key":"8647_CR21","doi-asserted-by":"crossref","unstructured":"Cai H, Ren K, Zhang W, et\u00a0al (2017) Real-time bidding by reinforcement learning in display advertising. In: Proceedings of the tenth ACM international conference on web search and data mining, pp 661\u2013670","DOI":"10.1145\/3018661.3018702"},{"key":"8647_CR22","doi-asserted-by":"crossref","unstructured":"Caragiannis I, Kaklamanis C, Kanellopoulos P et\u00a0al (2011) On the efficiency of equilibria in generalized second price auctions. In: Proceedings of the 12th ACM conference on Electronic commerce, pp 81\u201390","DOI":"10.1145\/1993574.1993588"},{"key":"8647_CR23","first-page":"7722","volume":"33","author":"A Celli","year":"2020","unstructured":"Celli A, Marchesi A, Farina G et al (2020) No-regret learning dynamics for extensive-form correlated equilibrium. Adv Neural Inf Process Syst 33:7722\u20137732","journal-title":"Adv Neural Inf Process Syst"},{"key":"8647_CR24","doi-asserted-by":"crossref","unstructured":"Che YK (1993) Design competition through multidimensional auctions. The RAND J Econ. pp 668\u2013680","DOI":"10.2307\/2555752"},{"issue":"1","key":"8647_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/1467-937X.00033","volume":"65","author":"YK Che","year":"1998","unstructured":"Che YK, Gale I (1998) Standard auctions with financially constrained bidders. Rev Econ Stud 65(1):1\u201321","journal-title":"Rev Econ Stud"},{"issue":"9","key":"8647_CR26","doi-asserted-by":"crossref","first-page":"1765","DOI":"10.1109\/TKDE.2018.2867027","volume":"31","author":"B Chen","year":"2019","unstructured":"Chen B, Kankanhalli MS (2019) Pricing average price advertising options when underlying spot market prices are discontinuous. IEEE Trans Knowl Data Eng 31(9):1765\u20131778","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"8647_CR27","doi-asserted-by":"crossref","unstructured":"Chen X, Hu G, Lu P et\u00a0al (2011) On the approximation ratio of k-lookahead auction. In: International workshop on internet and network economics, Springer, pp 61\u201371","DOI":"10.1007\/978-3-642-25510-6_6"},{"issue":"16","key":"8647_CR28","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1111\/j.1468-0335.1937.tb00002.x","volume":"4","author":"RH Coase","year":"1937","unstructured":"Coase RH (1937) The nature of the firm. Economica 4(16):386\u2013405","journal-title":"Economica"},{"key":"8647_CR29","unstructured":"Cong M, Yu H, Weng X et\u00a0al (2020) A VCG-based fair incentive mechanism for federated learning. arXiv preprint arXiv:2008.06680"},{"key":"8647_CR30","unstructured":"Conneau A, Lample G (2019) Cross-lingual language model pretraining. In: Advances in neural information processing systems, pp 7057\u20137067"},{"key":"8647_CR31","unstructured":"Curry MJ, Lyi U, Goldstein T et\u00a0al (2022) Learning revenue-maximizing auctions with differentiable matching. In: International conference on artificial intelligence and statistics, PMLR, pp 6062\u20136073"},{"key":"8647_CR32","doi-asserted-by":"crossref","unstructured":"Deng Y, Lyu F, Ren J et\u00a0al (2021) Fair: quality-aware federated learning with precise user incentive and model aggregation. In: IEEE INFOCOM 2021-IEEE conference on computer communications. IEEE, pp 1\u201310","DOI":"10.1109\/INFOCOM42981.2021.9488743"},{"key":"8647_CR33","doi-asserted-by":"crossref","unstructured":"Dickerson J, Sandholm T (2014) Multi-organ exchange: the whole is greater than the sum of its parts. In: Proceedings of the AAAI conference on artificial intelligence, pp 1412\u20131418","DOI":"10.1609\/aaai.v28i1.8885"},{"issue":"1","key":"8647_CR34","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1109\/JSAC.2020.3036944","volume":"39","author":"N Ding","year":"2020","unstructured":"Ding N, Fang Z, Huang J (2020) Optimal contract design for efficient federated learning with multi-dimensional private information. IEEE J Sel Areas Commun 39(1):186\u2013200","journal-title":"IEEE J Sel Areas Commun"},{"key":"8647_CR35","doi-asserted-by":"crossref","unstructured":"Ding W, Qin T, Zhang X et al (2013) Multi-armed bandit with budget constraint and variable costs. In: AAAI, pp 232\u2013238","DOI":"10.1609\/aaai.v27i1.8637"},{"issue":"2","key":"8647_CR36","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1016\/j.geb.2011.08.003","volume":"74","author":"S Dobzinski","year":"2012","unstructured":"Dobzinski S, Lavi R, Nisan N (2012) Multi-unit auctions with budget limits. Games Econ Behav 74(2):486\u2013503","journal-title":"Games Econ Behav"},{"issue":"2","key":"8647_CR37","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1109\/TNSE.2017.2787746","volume":"6","author":"J Du","year":"2017","unstructured":"Du J, Jiang C, Han Z et al (2017) Contract mechanism and performance analysis for data transaction in mobile social networks. IEEE Trans Netw Sci Eng 6(2):103\u2013115","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"8647_CR38","doi-asserted-by":"crossref","unstructured":"Du M, Cowen-Rivers AI, Wen Y et\u00a0al (2019) Infer your enemies and know yourself, learning in real-time bidding with partially observable opponents. arXiv preprint arXiv:1902.11212","DOI":"10.1109\/ICDMW.2019.00141"},{"key":"8647_CR39","unstructured":"Duan Z, Tang J, Yin Y et\u00a0al (2022) A context-integrated transformer-based neural network for auction design. ICML, pp 5609\u20135626"},{"issue":"1","key":"8647_CR40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2559049","volume":"3","author":"P D\u00fctting","year":"2015","unstructured":"D\u00fctting P, Fischer F, Jirapinyo P et al (2015a) Payment rules through discriminant-based classifiers. ACM Trans Econ Comput 3(1):1\u201341","journal-title":"ACM Trans Econ Comput"},{"issue":"1","key":"8647_CR41","first-page":"1","volume":"4","author":"P D\u00fctting","year":"2015","unstructured":"D\u00fctting P, Henzinger M, Starnberger M (2015) Auctions for heterogeneous items and budget limits. ACM Trans Econ Comput (TEAC) 4(1):1\u201317","journal-title":"ACM Trans Econ Comput (TEAC)"},{"key":"8647_CR42","unstructured":"D\u00fctting P, Feng Z, Narasimhan H, et\u00a0al (2019) Optimal auctions through deep learning. In: International conference on machine learning. PMLR, pp 1706\u20131715"},{"issue":"2","key":"8647_CR43","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1257\/aer.100.2.597","volume":"100","author":"B Edelman","year":"2010","unstructured":"Edelman B, Schwarz M (2010) Optimal auction design and equilibrium selection in sponsored search auctions. Am Econ Rev 100(2):597\u2013602","journal-title":"Am Econ Rev"},{"issue":"1","key":"8647_CR44","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1257\/aer.97.1.242","volume":"97","author":"B Edelman","year":"2007","unstructured":"Edelman B, Ostrovsky M, Schwarz M (2007) Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. Am Econ Rev 97(1):242\u2013259","journal-title":"Am Econ Rev"},{"key":"8647_CR45","doi-asserted-by":"crossref","unstructured":"Elkind E, Lipmaa H (2004) Interleaving cryptography and mechanism design: the case of online auctions. In: Financial Cryptography, pp 117\u2013131","DOI":"10.1007\/978-3-540-27809-2_16"},{"key":"8647_CR46","unstructured":"Ergin H, S\u00f6nmez T, \u00dcnver MU (2015) Lung exchange. Department of Economics, Boston College"},{"issue":"6","key":"8647_CR47","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1049\/iet-sen.2019.0338","volume":"14","author":"MV Fard","year":"2020","unstructured":"Fard MV, Sahafi A, Rahmani AM et al (2020) Resource allocation mechanisms in cloud computing: a systematic literature review. IET Softw 14(6):638\u2013653","journal-title":"IET Softw"},{"key":"8647_CR48","doi-asserted-by":"crossref","unstructured":"Farina G, Bianchi T, Sandholm T (2020) Coarse correlation in extensive-form games. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp 1934\u20131941","DOI":"10.1609\/aaai.v34i02.5563"},{"key":"8647_CR49","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TAC.2020.3046193","volume":"67","author":"M Fazlyab","year":"2020","unstructured":"Fazlyab M, Morari M, Pappas GJ (2020) Safety verification and robustness analysis of neural networks via quadratic constraints and semidefinite programming. IEEE Trans Autom Control 67:1\u201315","journal-title":"IEEE Trans Autom Control"},{"key":"8647_CR50","doi-asserted-by":"crossref","unstructured":"Feldman M, Lai K, Zhang L (2005) A price-anticipating resource allocation mechanism for distributed shared clusters. In: Proceedings of the 6th ACM conference on Electronic commerce, pp 127\u2013136","DOI":"10.1145\/1064009.1064023"},{"key":"8647_CR51","doi-asserted-by":"crossref","unstructured":"Feng S, Niyato D, Wang P et al (2019) Joint service pricing and cooperative relay communication for federated learning. In: 2019 international conference on internet of things (iThings) and IEEE green computing and communications (GreenCom) and IEEE cyber. Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData). IEEE, pp 815\u2013820","DOI":"10.1109\/iThings\/GreenCom\/CPSCom\/SmartData.2019.00148"},{"key":"8647_CR52","unstructured":"Feng Z, Narasimhan H, Parkes DC (2018) Deep learning for revenue-optimal auctions with budgets. In: Proceedings of the 17th international conference on autonomous agents and multiagent systems, pp 354\u2013362"},{"issue":"4","key":"8647_CR53","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1214\/09-AAP642","volume":"20","author":"D Fernholz","year":"2010","unstructured":"Fernholz D, Karatzas I (2010) On optimal arbitrage. Ann Appl Probab 20(4):1179\u20131204","journal-title":"Ann Appl Probab"},{"key":"8647_CR54","unstructured":"Foundation NS (2015) New directions in computational social choice and mechanism design. https:\/\/www.nsf.gov\/awardsearch\/showAward?AWD_ID=1527434"},{"issue":"1","key":"8647_CR55","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Mon 69(1):9\u201315","journal-title":"Am Math Mon"},{"key":"8647_CR56","doi-asserted-by":"crossref","unstructured":"Gao G, Huang H, Xiao M et\u00a0al (2021) Auction-based combinatorial multi-armed bandit mechanisms with strategic arms. In: IEEE INFOCOM 2021-IEEE conference on computer communications. IEEE, pp 1\u201310","DOI":"10.1109\/INFOCOM42981.2021.9488765"},{"key":"8647_CR57","doi-asserted-by":"crossref","unstructured":"Gasparini M, Nuara A, Trov\u00f2 F et\u00a0al (2018) Targeting optimization for internet advertising by learning from logged bandit feedback. IEEE, pp 1\u20138","DOI":"10.1109\/IJCNN.2018.8489092"},{"key":"8647_CR58","doi-asserted-by":"crossref","unstructured":"Gershkov A, Moldovanu B (2014) Dynamic allocation and pricing: a mechanism design approach. MIT Press","DOI":"10.7551\/mitpress\/9780262028400.001.0001"},{"key":"8647_CR59","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/j.geb.2012.09.001","volume":"86","author":"R Gomes","year":"2014","unstructured":"Gomes R, Sweeney K (2014) Bayes-nash equilibria of the generalized second-price auction. Games Econ Behav 86:421\u2013437","journal-title":"Games Econ Behav"},{"issue":"100","key":"8647_CR60","first-page":"914","volume":"40","author":"A Greenstein-Messica","year":"2020","unstructured":"Greenstein-Messica A, Rokach L (2020) Machine learning and operation research based method for promotion optimization of products with no price elasticity history. Electron Comm Res Appl 40(100):914","journal-title":"Electron Comm Res Appl"},{"key":"8647_CR61","doi-asserted-by":"crossref","unstructured":"Haghpanah N, Hartline J (2015) Reverse mechanism design. In: Proceedings of the sixteenth ACM conference on economics and computation, pp 757\u2013758","DOI":"10.1145\/2764468.2764498"},{"issue":"3","key":"8647_CR62","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1093\/restud\/rdaa053","volume":"88","author":"N Haghpanah","year":"2021","unstructured":"Haghpanah N, Hartline J (2021) When is pure bundling optimal? Rev Econ Stud 88(3):1127\u20131156","journal-title":"Rev Econ Stud"},{"key":"8647_CR63","unstructured":"Hausknecht M, Stone P (2015) Deep recurrent q-learning for partially observable mdps. In: 2015 AAAI fall symposium series"},{"key":"8647_CR64","unstructured":"Hosu I, Rebedea T (2016) Playing atari games with deep reinforcement learning and human checkpoint replay. CoRR abs\/1607.05077. https:\/\/arxiv.org\/abs\/1607.05077"},{"key":"8647_CR65","unstructured":"Hurwicz L (1960) Optimality and informational efficiency in resource allocation processes. In: Arrow KJ, Karlin S, Suppes P (eds) Mathematical methods in the social sciences. Stanford University Press, pp 27\u201346"},{"key":"8647_CR66","doi-asserted-by":"crossref","unstructured":"Jia J, Zhang Q, Zhang Q, et\u00a0al (2009) Revenue generation for truthful spectrum auction in dynamic spectrum access. In: Proceedings of the tenth ACM international symposium on mobile ad hoc networking and computing, pp 3\u201312","DOI":"10.1145\/1530748.1530751"},{"issue":"10","key":"8647_CR67","doi-asserted-by":"crossref","first-page":"3034","DOI":"10.1109\/TMC.2020.2994639","volume":"20","author":"Y Jiao","year":"2020","unstructured":"Jiao Y, Wang P, Niyato D et al (2020) Toward an automated auction framework for wireless federated learning services market. IEEE Trans Mob Comput 20(10):3034\u20133048","journal-title":"IEEE Trans Mob Comput"},{"key":"8647_CR68","doi-asserted-by":"crossref","unstructured":"Jin J, Song C, Li H et al (2018) Real-time bidding with multi-agent reinforcement learning in display advertising. In: The 27th ACM international conference on information and knowledge management, pp 2193\u20132201","DOI":"10.1145\/3269206.3272021"},{"issue":"3","key":"8647_CR69","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01774658","volume":"6","author":"E Kalai","year":"1977","unstructured":"Kalai E (1977) Nonsymmetric Nash solutions and replications of 2-person bargaining. Int J Game Theory 6(3):129\u2013133","journal-title":"Int J Game Theory"},{"issue":"2","key":"8647_CR70","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1090\/S0002-9939-1975-0368707-8","volume":"49","author":"E Kalai","year":"1975","unstructured":"Kalai E, Smorodinsky M (1975a) On a game theoretic notion of complexity for compact convex sets. Proc Am Math Soc 49(2):416\u2013420","journal-title":"Proc Am Math Soc"},{"issue":"3","key":"8647_CR71","first-page":"513","volume":"71","author":"E Kalai","year":"1975","unstructured":"Kalai E, Smorodinsky M (1975b) Other solutions to Nash\u2019s bargaining problem. Econom J Econ Soc 71(3):513\u2013518","journal-title":"Econom J Econ Soc"},{"issue":"6","key":"8647_CR72","doi-asserted-by":"crossref","first-page":"10700","DOI":"10.1109\/JIOT.2019.2940820","volume":"6","author":"J Kang","year":"2019","unstructured":"Kang J, Xiong Z, Niyato D et al (2019) Incentive mechanism for reliable federated learning: a joint optimization approach to combining reputation and contract theory. IEEE Internet Things J 6(6):10700\u201310714","journal-title":"IEEE Internet Things J"},{"issue":"9","key":"8647_CR73","doi-asserted-by":"crossref","first-page":"1320","DOI":"10.1038\/s41562-022-01444-1","volume":"6","author":"R Koster","year":"2022","unstructured":"Koster R, Balaguer J, Tacchetti A et al (2022) Human-centered mechanism design with democratic AI. Nat Hum Behav 6(9):1320\u20131320","journal-title":"Nat Hum Behav"},{"key":"8647_CR74","unstructured":"Krizhevsky A, Sutskever I, Hinton GE (2012) Imagenet classification with deep convolutional neural networks. pp 1106\u20131114"},{"key":"8647_CR75","doi-asserted-by":"crossref","unstructured":"Lahaie S, Pennock DM, Saberi A et al (2007) Sponsored search auctions. In: Algorithmic game theory, vol 1, pp 699\u2013716","DOI":"10.1017\/CBO9780511800481.030"},{"key":"8647_CR76","doi-asserted-by":"crossref","unstructured":"Le THT, Tran NH, Tun YK et\u00a0al (2020) Auction based incentive design for efficient federated learning in cellular wireless networks. In: 2020 IEEE wireless communications and networking conference (WCNC). IEEE, pp 1\u20136","DOI":"10.1109\/WCNC45663.2020.9120773"},{"key":"8647_CR77","doi-asserted-by":"crossref","unstructured":"Leme RP, Tardos E (2010) Pure and bayes-Nash price of anarchy for generalized second price auction. In: 2010 IEEE 51st annual symposium on foundations of computer science. IEEE, pp 735\u2013744","DOI":"10.1109\/FOCS.2010.75"},{"issue":"4","key":"8647_CR78","doi-asserted-by":"crossref","first-page":"2749","DOI":"10.1007\/s11831-020-09475-5","volume":"28","author":"H Li","year":"2021","unstructured":"Li H, Wang X, Jia F et al (2021) A survey of Nash equilibrium strategy solving based on CFR. Arch Comput Methods Eng 28(4):2749\u20132760","journal-title":"Arch Comput Methods Eng"},{"issue":"SI","key":"8647_CR79","first-page":"398","volume":"104","author":"J Li","year":"2020","unstructured":"Li J, Zhao L (2020) Game analysis of hydropower bidding under incomplete information. J Coast Res 104(SI):398\u2013401","journal-title":"J Coast Res"},{"issue":"10","key":"8647_CR80","doi-asserted-by":"crossref","first-page":"9575","DOI":"10.1109\/JIOT.2020.2985694","volume":"7","author":"WYB Lim","year":"2020","unstructured":"Lim WYB, Xiong Z, Miao C et al (2020) Hierarchical incentive mechanism design for federated machine learning in mobile networks. IEEE Internet Things J 7(10):9575\u20139588","journal-title":"IEEE Internet Things J"},{"key":"8647_CR81","doi-asserted-by":"crossref","unstructured":"Ling CK, Brown N (2021) Safe search for Stackelberg equilibria in extensive-form games. In: Proceedings of the AAAI conference on artificial intelligence, pp 5541\u20135548","DOI":"10.1609\/aaai.v35i6.16697"},{"key":"8647_CR82","doi-asserted-by":"crossref","unstructured":"Liu Y, Xu G, Tan X (2009) A novel spectrum allocation mechanism based on graph coloring and bidding theory. In: 2009 International conference on computational intelligence and natural computing. IEEE, pp 155\u2013158","DOI":"10.1109\/CINC.2009.98"},{"key":"8647_CR83","doi-asserted-by":"crossref","unstructured":"Liu Y, Ai Z, Sun S et al (2020) Fedcoin: A peer-to-peer payment system for federated learning. In: Federated learning: privacy and incentive, pp 125\u2013138","DOI":"10.1007\/978-3-030-63076-8_9"},{"key":"8647_CR84","unstructured":"Lu R, Zhang W, Li Q et\u00a0al (2021) Auction based clustered federated learning in mobile edge computing system. arXiv preprint arXiv:2103.07150"},{"key":"8647_CR85","doi-asserted-by":"crossref","unstructured":"Lucier B, Leme RP (2011) GSP auctions with correlated types. In: Proceedings of the 12th ACM conference on electronic commerce, pp 71\u201380","DOI":"10.1145\/1993574.1993587"},{"key":"8647_CR86","doi-asserted-by":"crossref","unstructured":"Lucier B, Paes\u00a0Leme R, Tardos \u00c9 (2012) On revenue in the generalized second price auction. In: Proceedings of the 21st international conference on World Wide Web, pp 361\u2013370","DOI":"10.1145\/2187836.2187886"},{"key":"8647_CR87","first-page":"25","volume":"2","author":"Mafita","year":"2019","unstructured":"Mafita (2019) Implementation of auctions through the internet for state-owned assets of the state assets service office and Serang auctions based on the principle of legal certainty. Nurani Hukum 2:25","journal-title":"Nurani Hukum"},{"issue":"1","key":"8647_CR88","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jet.2005.08.007","volume":"127","author":"AM Manelli","year":"2006","unstructured":"Manelli AM, Vincent DR (2006) Bundling as an optimal selling mechanism for a multiple-good monopolist. J Econ Theory 127(1):1\u201335","journal-title":"J Econ Theory"},{"issue":"2","key":"8647_CR89","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1016\/j.ejor.2020.12.022","volume":"293","author":"G Mart\u00edn-Herr\u00e1n","year":"2021","unstructured":"Mart\u00edn-Herr\u00e1n G, Rubio SJ (2021) On coincidence of feedback and global Stackelberg equilibria in a class of differential games. Eur J Oper Res 293(2):761\u2013772","journal-title":"Eur J Oper Res"},{"issue":"1","key":"8647_CR90","first-page":"22","volume":"66","author":"E Maskin","year":"1999","unstructured":"Maskin E (1999) Nash equilibrium and welfare optimality. Rev Econ Stud 66(1):22\u201338","journal-title":"Rev Econ Stud"},{"key":"8647_CR91","unstructured":"Mas-Colell A, Whinston M, Green J (1995) microeconomic theory. Oxford student edn. Oxford University Press. https:\/\/books.google.com\/books?id=sQGDQgAACAAJ"},{"key":"8647_CR92","doi-asserted-by":"crossref","unstructured":"McCarthy A, Smyth B, Quaglia EA (2014) Hawk and Aucitas: e-auction schemes from the Helios and Civitas e-voting schemes. In: International conference on financial cryptography and data security. Springer, pp 51\u201363","DOI":"10.1007\/978-3-662-45472-5_4"},{"issue":"2","key":"8647_CR93","doi-asserted-by":"crossref","first-page":"36","DOI":"10.3390\/jsan10020036","volume":"10","author":"S Milani","year":"2021","unstructured":"Milani S, Chatzigiannakis I (2021) Design, analysis, and experimental evaluation of a new secure rejoin mechanism for Lorawan using elliptic-curve cryptography. J Sens Actuator Netw 10(2):36","journal-title":"J Sens Actuator Netw"},{"key":"8647_CR94","doi-asserted-by":"crossref","DOI":"10.7312\/milg17598","volume-title":"Discovering prices: auction design in markets with complex constraints","author":"P Milgrom","year":"2017","unstructured":"Milgrom P (2017) Discovering prices: auction design in markets with complex constraints. Columbia University Press"},{"issue":"5","key":"8647_CR95","doi-asserted-by":"crossref","first-page":"1383","DOI":"10.1257\/aer.111.5.1383","volume":"111","author":"P Milgrom","year":"2021","unstructured":"Milgrom P (2021) Auction research evolving: theorems and market designs. Am Econ Rev 111(5):1383\u20131405","journal-title":"Am Econ Rev"},{"issue":"1","key":"8647_CR96","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1086\/704074","volume":"128","author":"P Milgrom","year":"2020","unstructured":"Milgrom P, Segal I (2020) Clock auctions and radio spectrum reallocation. J Polit Econ 128(1):1\u201331","journal-title":"J Polit Econ"},{"key":"8647_CR97","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1007\/s10660-021-09513-9","volume":"23","author":"L Miralles-Pechu\u00e1n","year":"2021","unstructured":"Miralles-Pechu\u00e1n L, Qureshi MA, Namee BM (2021) Real-time bidding campaigns optimization using user profile settings. Electron Commer Res 23:1297\u20131322","journal-title":"Electron Commer Res"},{"issue":"2","key":"8647_CR98","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2296779","volume":"38","author":"JA Mirrlees","year":"1971","unstructured":"Mirrlees JA (1971) An exploration in the theory of optimum income taxation. Rev Econ Stud 38(2):175\u2013208","journal-title":"Rev Econ Stud"},{"key":"8647_CR99","doi-asserted-by":"crossref","unstructured":"Mkiramweni ME, Yang C (2018) Energy efficiency optimization for wireless unmanned aerial vehicle communication networks: a bargaining game approach. In: 2018 10th international conference on wireless communications and signal processing (WCSP). IEEE, pp 1\u20136","DOI":"10.1109\/WCSP.2018.8555719"},{"issue":"7540","key":"8647_CR100","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih V, Kavukcuoglu K, Silver D et al (2015) Human-level control through deep reinforcement learning. Nature 518(7540):529\u2013533","journal-title":"Nature"},{"key":"8647_CR101","unstructured":"Mnih V, Badia AP, Mirza M et\u00a0al (2016) Asynchronous methods for deep reinforcement learning. In: International conference on machine learning, PMLR, pp 1928\u20131937"},{"key":"8647_CR102","unstructured":"Mohri M, Munoz A (2014) Optimal regret minimization in posted-price auctions with strategic buyers. In: Advances in neural information processing systems, NIPS, pp 1871\u20131879"},{"key":"8647_CR103","unstructured":"Moldovanu B (1990) Competition and bargaining in games and markets. PhD thesis, University of Bonn, Germany. https:\/\/d-nb.info\/911190341"},{"issue":"6337","key":"8647_CR104","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1126\/science.aam6960","volume":"356","author":"M Morav\u010d\u00edk","year":"2017","unstructured":"Morav\u010d\u00edk M, Schmid M, Burch N et al (2017) Deepstack: expert-level artificial intelligence in heads-up no-limit poker. Science 356(6337):508\u2013513","journal-title":"Science"},{"issue":"1","key":"8647_CR105","first-page":"61","volume":"47","author":"RB Myerson","year":"1979","unstructured":"Myerson RB (1979) Incentive compatibility and the bargaining problem. Econometr J Econ Soc 47(1):61\u201373","journal-title":"Econometr J Econ Soc"},{"key":"8647_CR106","unstructured":"Nachum O, Gu SS, Lee H et al (2018) Data-efficient hierarchical reinforcement learning. In: Advances in neural information processing systems, NIPS, pp 3307\u20133317"},{"key":"8647_CR107","doi-asserted-by":"crossref","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash J (1951) Non-cooperative games. Ann Math 54:286\u2013295","journal-title":"Ann Math"},{"key":"8647_CR108","first-page":"128","volume":"21","author":"J Nash","year":"1953","unstructured":"Nash J (1953) Two-person cooperative games. Econom J Econom Soc 21:128\u2013140","journal-title":"Econom J Econom Soc"},{"key":"8647_CR109","first-page":"155","volume":"18","author":"JF Nash Jr","year":"1950","unstructured":"Nash Jr JF (1950) The bargaining problem. Econom J Econom Soc 18:155\u2013162","journal-title":"Econom J Econom Soc"},{"key":"8647_CR110","doi-asserted-by":"crossref","unstructured":"Newman N, Leyton-Brown K, Milgrom P et\u00a0al (2020) Incentive auction design alternatives: a simulation study. In: Proceedings of the 21st ACM conference on economics and computation, pp 603\u2013604","DOI":"10.1145\/3391403.3399499"},{"key":"8647_CR111","doi-asserted-by":"crossref","unstructured":"Nisan N, Roughgarden T, Tardos E et\u00a0al (2007) Algorithmic game theory. Cambridge University Press. https:\/\/books.google.com\/books?id=f4SFngEACAAJ","DOI":"10.1017\/CBO9780511800481"},{"key":"8647_CR112","doi-asserted-by":"crossref","unstructured":"Nuara A, Trovo F, Gatti N et\u00a0al (2018) A combinatorial-bandit algorithm for the online joint bid\/budget optimization of pay-per-click advertising campaigns. In: Thirty-second AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v32i1.11888"},{"issue":"19","key":"8647_CR113","doi-asserted-by":"crossref","first-page":"6542","DOI":"10.3390\/s21196542","volume":"21","author":"I Nurcahyani","year":"2021","unstructured":"Nurcahyani I, Lee JW (2021) Role of machine learning in resource allocation strategy over vehicular networks: a survey. Sensors 21(19):6542","journal-title":"Sensors"},{"key":"8647_CR114","unstructured":"Ortega-Reichert A (1968) Models for competitive bidding under uncertainty. Stanford University"},{"key":"8647_CR115","volume-title":"Advances in neural information processing systems","author":"DC Parkes","year":"2003","unstructured":"Parkes DC, Singh S (2003) An MDP-based approach to online mechanism design. In: Thrun S, Saul L, Sch\u00f6lkopf B (eds) Advances in neural information processing systems, vol 16. MIT Press"},{"issue":"2","key":"8647_CR116","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1086\/262118","volume":"108","author":"M Paul","year":"2000","unstructured":"Paul M (2000) Putting auction theory to work: the simultaneous ascending auction. J Polit Econ 108(2):245\u2013272","journal-title":"J Polit Econ"},{"issue":"1","key":"8647_CR117","first-page":"1","volume":"11","author":"G Pavlov","year":"2011","unstructured":"Pavlov G (2011) Optimal mechanism for selling two goods. BE J Theor Econ 11(1):1\u201335","journal-title":"BE J Theor Econ"},{"key":"8647_CR118","unstructured":"Pavlov G (2020) Selling two units of a customizable good. Tech rep, Working paper, University of Western Ontario"},{"key":"8647_CR119","unstructured":"Peleg B, Sudh\u00f6lter P (2007) Introduction to the theory of cooperative games, vol 34. Springer"},{"key":"8647_CR120","first-page":"17532","volume":"34","author":"N Peri","year":"2021","unstructured":"Peri N, Curry M, Dooley S et al (2021) Preferencenet: encoding human preferences in auction design with deep learning. Adv Neural Inf Process Syst 34:17532\u201317542","journal-title":"Adv Neural Inf Process Syst"},{"issue":"2","key":"8647_CR121","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1016\/j.geb.2008.10.001","volume":"66","author":"C Pitchik","year":"2009","unstructured":"Pitchik C (2009) Budget-constrained sequential auctions with incomplete information. Games Econ Behav 66(2):928\u2013949","journal-title":"Games Econ Behav"},{"issue":"2","key":"8647_CR122","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10723-014-9292-9","volume":"12","author":"MB Qureshi","year":"2014","unstructured":"Qureshi MB, Dehnavi MM, Min-Allah N et al (2014) Survey on grid resource allocation mechanisms. J Grid Comput 12(2):399\u2013441","journal-title":"J Grid Comput"},{"key":"8647_CR123","doi-asserted-by":"crossref","unstructured":"Rahme J, Jelassi S, Bruna J et\u00a0al (2021) A permutation-equivariant neural network architecture for auction design. In: Proceedings of the AAAI conference on artificial intelligence, pp 5664\u20135672","DOI":"10.1609\/aaai.v35i6.16711"},{"issue":"106","key":"8647_CR124","first-page":"672","volume":"213","author":"MJ Rezaee","year":"2021","unstructured":"Rezaee MJ, Eshkevari M, Saberi M et al (2021) GBK-means clustering algorithm: an improvement to the k-means algorithm based on the bargaining game. Knowl-Based Syst 213(106):672","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"8647_CR125","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/COMST.2019.2943405","volume":"22","author":"TK Rodrigues","year":"2019","unstructured":"Rodrigues TK, Suto K, Nishiyama H et al (2019) Machine learning meets computation and communication control in evolving edge and cloud: challenges and future perspective. IEEE Commun Surv Tutor 22(1):38\u201367","journal-title":"IEEE Commun Surv Tutor"},{"key":"8647_CR126","unstructured":"Rohde D, Bonner S, Dunlop T et\u00a0al (2018) Recogym: a reinforcement learning environment for the problem of product recommendation in online advertising. CoRR abs\/1808.00720. https:\/\/arxiv.org\/abs\/1808.00720"},{"key":"8647_CR127","doi-asserted-by":"crossref","unstructured":"Ronen A (2001) On approximating optimal auctions. In: Proceedings of the 3rd ACM conference on electronic commerce, pp 11\u201317","DOI":"10.1145\/501158.501160"},{"issue":"2","key":"8647_CR128","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0022-0531(85)90106-1","volume":"36","author":"AE Roth","year":"1985","unstructured":"Roth AE (1985) The college admissions problem is not equivalent to the marriage problem. J Econ Theor 36(2):277\u2013288","journal-title":"J Econ Theor"},{"key":"8647_CR129","doi-asserted-by":"crossref","unstructured":"Salomatin K, Liu TY, Yang Y (2012) A unified optimization framework for auction and guaranteed delivery in online advertising. In: Proceedings of the 21st ACM international conference on information and knowledge management, pp 2005\u20132009","DOI":"10.1145\/2396761.2398561"},{"issue":"6218","key":"8647_CR130","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1126\/science.aaa4614","volume":"347","author":"T Sandholm","year":"2015","unstructured":"Sandholm T (2015) Solving imperfect-information games. Science 347(6218):122\u2013123","journal-title":"Science"},{"key":"8647_CR131","unstructured":"Schelling T (1960) The strategy of conflict. Mass. https:\/\/books.google.com\/books?id=BeG2swEACAAJ"},{"issue":"1","key":"8647_CR132","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.ejor.2010.01.038","volume":"206","author":"S Schneider","year":"2010","unstructured":"Schneider S, Shabalin P, Bichler M (2010) On the robustness of non-linear personalized price combinatorial auctions. Eur J Oper Res 206(1):248\u2013259","journal-title":"Eur J Oper Res"},{"issue":"4","key":"8647_CR133","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1287\/mksc.2016.1023","volume":"36","author":"EM Schwartz","year":"2017","unstructured":"Schwartz EM, Bradlow ET, Fader PS (2017) Customer acquisition via display advertising using multi-armed bandit experiments. Mark Sci 36(4):500\u2013522","journal-title":"Mark Sci"},{"issue":"10","key":"8647_CR134","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1073\/pnas.39.10.1095","volume":"39","author":"LS Shapley","year":"1953","unstructured":"Shapley LS (1953) Stochastic games. Proc Natl Acad Sci 39(10):1095\u20131100","journal-title":"Proc Natl Acad Sci"},{"issue":"16","key":"8647_CR135","doi-asserted-by":"crossref","DOI":"10.1002\/cpe.4456","volume":"30","author":"F Sheikholeslami","year":"2018","unstructured":"Sheikholeslami F, Jafari Navimipour N (2018) Auction-based resource allocation mechanisms in the cloud environments: a review of the literature and reflection on future challenges. Concurr Comput Pract Exp 30(16):e4456","journal-title":"Concurr Comput Pract Exp"},{"key":"8647_CR136","doi-asserted-by":"crossref","unstructured":"Shen W, Peng B, Liu H et\u00a0al (2020) Reinforcement mechanism design: with applications to dynamic pricing in sponsored search auctions. In: Proceedings of the AAAI conference on artificial intelligence, pp 2236\u20132243","DOI":"10.1609\/aaai.v34i02.5600"},{"key":"8647_CR137","doi-asserted-by":"crossref","unstructured":"Shen W, Tang P, Wang X et\u00a0al (2021) Coupon design in advertising systems. AAAI Press, pp 5717\u20135725","DOI":"10.1609\/aaai.v35i6.16717"},{"key":"8647_CR138","unstructured":"Shi E, Chung H, Wu K (2022) What can cryptography do for decentralized mechanism design. arXiv preprint arXiv:2209.14462"},{"issue":"7587","key":"8647_CR139","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver D, Huang A, Maddison CJ et al (2016) Mastering the game of go with deep neural networks and tree search. Nature 529(7587):484\u2013489","journal-title":"Nature"},{"issue":"7676","key":"8647_CR140","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1038\/nature24270","volume":"550","author":"D Silver","year":"2017","unstructured":"Silver D, Schrittwieser J, Simonyan K et al (2017) Mastering the game of go without human knowledge. Nature 550(7676):354\u2013359","journal-title":"Nature"},{"key":"8647_CR141","doi-asserted-by":"crossref","unstructured":"Singer Y (2010) Budget feasible mechanisms. In: 2010 IEEE 51st annual symposium on foundations of computer science. IEEE, pp 765\u2013774","DOI":"10.1109\/FOCS.2010.78"},{"key":"8647_CR142","doi-asserted-by":"crossref","unstructured":"Song T, Tong Y, Wei S (2019) Profit allocation for federated learning. In: 2019 IEEE international conference on big data (big data). IEEE, pp 2577\u20132586","DOI":"10.1109\/BigData47090.2019.9006327"},{"issue":"12","key":"8647_CR143","doi-asserted-by":"crossref","first-page":"3805","DOI":"10.1109\/JSAC.2021.3118354","volume":"39","author":"P Sun","year":"2021","unstructured":"Sun P, Che H, Wang Z et al (2021) Pain-FL: personalized privacy-preserving incentive for federated learning. IEEE J Sel Areas Commun 39(12):3805\u20133820","journal-title":"IEEE J Sel Areas Commun"},{"key":"8647_CR144","doi-asserted-by":"crossref","unstructured":"Sun Z, Liu Y, Wang J et\u00a0al (2021b) Applications of game theory in vehicular networks: a survey. IEEE Commun Surv Tutor","DOI":"10.1109\/COMST.2021.3108466"},{"key":"8647_CR145","unstructured":"Sutton RS, McAllester DA, Singh SP et\u00a0al (1999) Policy gradient methods for reinforcement learning with function approximation. The MIT Press, pp 1057\u20131063"},{"key":"8647_CR146","doi-asserted-by":"crossref","unstructured":"Tang L, Rosales R, Singh A et al (2013) Automatic ad format selection via contextual bandits. In: Proceedings of the 22nd ACM international conference on Information & Knowledge Management, pp 1587\u20131594","DOI":"10.1145\/2505515.2514700"},{"key":"8647_CR147","doi-asserted-by":"crossref","unstructured":"Tang P (2017) Reinforcement mechanism design. IJCAI, pp 5146\u20135150","DOI":"10.24963\/ijcai.2017\/739"},{"key":"8647_CR148","unstructured":"Thirumulanathan D, Sundaresan R, Narahari Y (2017) On optimal mechanisms in the two-item single-buyer unit-demand setting. CoRR abs\/1705.01821. https:\/\/arxiv.org\/abs\/1705.01821"},{"key":"8647_CR149","doi-asserted-by":"crossref","unstructured":"Tossou AC, Dimitrakakis C (2016) Algorithms for differentially private multi-armed bandits. In: Thirtieth AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v30i1.10212"},{"issue":"1","key":"8647_CR150","first-page":"221","volume":"15","author":"R Valen\u010d\u00edk","year":"2021","unstructured":"Valen\u010d\u00edk R, \u010cern\u00edk O et al (2021) The inequality in society and a multipoint extension of Nash bargaining problem. Econ Bus J 15(1):221\u2013232","journal-title":"Econ Bus J"},{"key":"8647_CR151","doi-asserted-by":"crossref","unstructured":"van Hasselt H, Guez A, Silver D (2016) Deep reinforcement learning with double q-learning. AAAI Press, pp 2094\u20132100","DOI":"10.1609\/aaai.v30i1.10295"},{"issue":"6","key":"8647_CR152","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1016\/j.ijindorg.2006.10.002","volume":"25","author":"HR Varian","year":"2007","unstructured":"Varian HR (2007) Position auctions. Int J Ind Organ 25(6):1163\u20131178","journal-title":"Int J Ind Organ"},{"issue":"2","key":"8647_CR153","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1257\/aer.99.2.430","volume":"99","author":"HR Varian","year":"2009","unstructured":"Varian HR (2009) Online ad auctions. Am Econ Rev 99(2):430\u201334","journal-title":"Am Econ Rev"},{"issue":"1","key":"8647_CR154","doi-asserted-by":"crossref","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. J Financ 16(1):8\u201337","journal-title":"J Financ"},{"key":"8647_CR155","unstructured":"Vickrey W (1962) Auctions and bidding games. In: Recent advances in game theory, Princeton University conference, pp 15\u201329"},{"key":"8647_CR156","doi-asserted-by":"crossref","unstructured":"Von\u00a0Neumann J, Morgenstern O (2020) Theory of games and economic behavior. Sidney Bond. https:\/\/books.google.com\/books?id=nQ1NzQEACAAJ","DOI":"10.1007\/978-3-476-05728-0_22972-1"},{"key":"8647_CR157","doi-asserted-by":"crossref","unstructured":"Wang G, Dang CX, Zhou Z (2019) Measure contribution of participants in federated learning. In: 2019 IEEE international conference on big data (big data). IEEE, pp 2597\u20132604","DOI":"10.1109\/BigData47090.2019.9006179"},{"key":"8647_CR158","doi-asserted-by":"crossref","first-page":"1172","DOI":"10.1016\/j.egyr.2022.02.078","volume":"8","author":"M Wang","year":"2022","unstructured":"Wang M, Song Y, Sui B et al (2022) Comparative study of pricing mechanisms and settlement methods in electricity spot energy market based on multi-agent simulation. Energy Rep 8:1172\u20131182","journal-title":"Energy Rep"},{"issue":"3","key":"8647_CR159","doi-asserted-by":"crossref","first-page":"1:91","DOI":"10.1145\/3204461","volume":"12","author":"Y Wang","year":"2018","unstructured":"Wang Y, Yin D, Jie L et al (2018) Optimizing whole-page presentation for web search. ACM Trans Web 12(3):1:91\u201319:25","journal-title":"ACM Trans Web"},{"issue":"7","key":"8647_CR160","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1287\/mnsc.15.7.446","volume":"15","author":"RB Wilson","year":"1969","unstructured":"Wilson RB (1969) Communications to the editor\u2014competitive bidding with disparate information. Manag Sci 15(7):446\u2013452","journal-title":"Manag Sci"},{"key":"8647_CR161","doi-asserted-by":"crossref","unstructured":"Wu D, Chen X, Yang X et al (2018) Budget constrained bidding by model-free reinforcement learning in display advertising. In: Proceedings on 27th ACM international conference on information and knowledge management, pp 1443\u20131451","DOI":"10.1145\/3269206.3271748"},{"key":"8647_CR162","unstructured":"Wu D, Chen C, Yang X, et\u00a0al (2018a) A multi-agent reinforcement learning method for impression allocation in online display advertising. CoRR abs\/1809.03152. https:\/\/arxiv.org\/abs\/1809.03152"},{"key":"8647_CR163","doi-asserted-by":"crossref","unstructured":"Wu D, Chen X, Yang X et\u00a0al (2018b) Budget constrained bidding by model-free reinforcement learning in display advertising. pp 1443\u20131451","DOI":"10.1145\/3269206.3271748"},{"key":"8647_CR164","doi-asserted-by":"crossref","unstructured":"Wu HT, Yang CY (2018) A blockchain-based network security mechanism for voting systems. In: 2018 1st international cognitive cities conference (IC3). IEEE, pp 227\u2013230","DOI":"10.1109\/IC3.2018.00-15"},{"issue":"13","key":"8647_CR165","doi-asserted-by":"crossref","first-page":"10,639","DOI":"10.1109\/JIOT.2021.3050163","volume":"8","author":"M Wu","year":"2021","unstructured":"Wu M, Ye D, Ding J et al (2021) Incentivizing differentially private federated learning: a multidimensional contract approach. IEEE Internet Things J 8(13):10,639-10,651","journal-title":"IEEE Internet Things J"},{"key":"8647_CR166","first-page":"2400","volume":"26","author":"M Xu","year":"2013","unstructured":"Xu M, Qin T, Liu T (2013) Estimation bias in multi-armed bandit algorithms for search advertising. Adv Neural Inf Process Syst 26:2400\u20132408","journal-title":"Adv Neural Inf Process Syst"},{"issue":"1","key":"8647_CR167","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1111\/poms.13525","volume":"31","author":"C Yang","year":"2022","unstructured":"Yang C, Feng Y, Whinston A (2022) Dynamic pricing and information disclosure for fresh produce: an artificial intelligence approach. Prod Oper Manag 31(1):155\u2013171","journal-title":"Prod Oper Manag"},{"key":"8647_CR168","doi-asserted-by":"crossref","unstructured":"Yang H, Lu Q (2016) Dynamic contextual multi arm bandits in display advertisement. IEEE Computer Society, pp 1305\u20131310","DOI":"10.1109\/ICDM.2016.0177"},{"key":"8647_CR169","doi-asserted-by":"crossref","unstructured":"Yao ACC (2017) Dominant-strategy versus Bayesian multi-item auctions: maximum revenue determination and comparison. In: Proceedings of the 2017 ACM conference on economics and computation, pp 3\u201320","DOI":"10.1145\/3033274.3085120"},{"issue":"5","key":"8647_CR170","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1109\/TPDS.2012.213","volume":"24","author":"D Ye","year":"2013","unstructured":"Ye D, Zhang M, Sutanto D (2013) Self-adaptation-based dynamic coalition formation in a distributed agent network: a mechanism and a brief survey. IEEE Trans Parallel Distrib Syst 24(5):1042\u20131051","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"8647_CR171","unstructured":"Yuan S, Wang J, van\u00a0der Meer M (2013) Adaptive keywords extraction with contextual bandits for advertising on parked domains. CoRR abs\/1307.3573. https:\/\/arxiv.org\/abs\/1307.3573"},{"key":"8647_CR172","doi-asserted-by":"crossref","unstructured":"Zeng H, Zhou T, Guo Y et\u00a0al (2021) Fedcav: contribution-aware model aggregation on distributed heterogeneous data in federated learning. In: 50th international conference on parallel processing, pp 1\u201310","DOI":"10.1145\/3472456.3472504"},{"key":"8647_CR173","doi-asserted-by":"crossref","unstructured":"Zeng R, Zhang S, Wang J et\u00a0al (2020) Fmore: an incentive scheme of multi-dimensional auction for federated learning in MEC. In: 2020 IEEE 40th international conference on distributed computing systems (ICDCS). IEEE, pp 278\u2013288","DOI":"10.1109\/ICDCS47774.2020.00094"},{"issue":"7","key":"8647_CR174","doi-asserted-by":"crossref","first-page":"6360","DOI":"10.1109\/JIOT.2020.2967772","volume":"7","author":"Y Zhan","year":"2020","unstructured":"Zhan Y, Li P, Qu Z et al (2020) A learning-based incentive mechanism for federated learning. IEEE Internet Things J 7(7):6360\u20136368","journal-title":"IEEE Internet Things J"},{"issue":"2","key":"8647_CR175","first-page":"1035","volume":"10","author":"Y Zhan","year":"2021","unstructured":"Zhan Y, Zhang J, Hong Z et al (2021) A survey of incentive mechanism design for federated learning. IEEE Trans Emerg Top Comput 10(2):1035\u20131044","journal-title":"IEEE Trans Emerg Top Comput"},{"key":"8647_CR176","doi-asserted-by":"crossref","unstructured":"Zhang BH, Farina G, Celli A et\u00a0al (2022a) Optimal correlated equilibria in general-sum extensive-form games: fixed-parameter algorithms, hardness, and two-sided column-generation. In: Proceedings of the 23rd ACM conference on economics and computation, pp 1119\u20131120","DOI":"10.1145\/3490486.3538330"},{"key":"8647_CR177","unstructured":"Zhang BH, Farina G, Sandholm T (2022b) Team belief DAG form: a concise representation for team-correlated game-theoretic decision making. arXiv preprint arXiv:2202.00789"},{"key":"8647_CR178","doi-asserted-by":"crossref","unstructured":"Zhang T, Wang H, He J (2016) An incentive mechanism under hidden-action for device-to-device content sharing. In: 2016 IEEE 13th international conference on signal processing (ICSP). IEEE, pp 1288\u20131292","DOI":"10.1109\/ICSP.2016.7878034"},{"issue":"10","key":"8647_CR179","doi-asserted-by":"crossref","first-page":"2144","DOI":"10.1109\/JSAC.2015.2435356","volume":"33","author":"Y Zhang","year":"2015","unstructured":"Zhang Y, Song L, Saad W et al (2015) Contract-based incentive mechanisms for device-to-device communications in cellular networks. IEEE J Sel Areas Commun 33(10):2144\u20132155","journal-title":"IEEE J Sel Areas Commun"},{"key":"8647_CR180","doi-asserted-by":"crossref","unstructured":"Zhang Z, Liu X, Zheng Z et\u00a0al (2021) Optimizing multiple performance metrics with deep GSP auctions for e-commerce advertising. ACM, pp 993\u20131001","DOI":"10.1145\/3437963.3441771"},{"key":"8647_CR181","doi-asserted-by":"crossref","unstructured":"Zhao X, Gu C, Zhang H et\u00a0al (2021) DEAR: deep reinforcement learning for online advertising impression in recommender systems. AAAI Press, pp 750\u2013758","DOI":"10.1609\/aaai.v35i1.16156"},{"key":"8647_CR182","doi-asserted-by":"crossref","unstructured":"Zheng L, Fiez T, Alumbaugh Z et\u00a0al (2022a) Stackelberg actor-critic: game-theoretic reinforcement learning algorithms. In: Proceedings of the AAAI conference on artificial intelligence, pp 9217\u20139224","DOI":"10.1609\/aaai.v36i8.20908"},{"issue":"18","key":"8647_CR183","doi-asserted-by":"crossref","first-page":"eabk2607","DOI":"10.1126\/sciadv.abk2607","volume":"8","author":"S Zheng","year":"2022","unstructured":"Zheng S, Trott A, Srinivasa S et al (2022) The AI economist: optimal economic policy design via two-level deep reinforcement learning. Sci Adv 8(18):eabk2607","journal-title":"Sci Adv"},{"issue":"11","key":"8647_CR184","doi-asserted-by":"crossref","first-page":"4231","DOI":"10.1016\/j.enpol.2009.05.019","volume":"37","author":"X Zou","year":"2009","unstructured":"Zou X (2009) Double-sided auction mechanism design in electricity based on maximizing social welfare. Energy Policy 37(11):4231\u20134239","journal-title":"Energy Policy"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08647-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-08647-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08647-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:35:40Z","timestamp":1744216540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-08647-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,20]]},"references-count":184,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["8647"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-08647-1","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,20]]},"assertion":[{"value":"28 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We have no conflict of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}