{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T04:19:15Z","timestamp":1665375555945},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,2,25]],"date-time":"2015-02-25T00:00:00Z","timestamp":1424822400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s10489-014-0643-9","type":"journal-article","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T20:36:49Z","timestamp":1424723809000},"page":"308-324","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Scalable multi-agent learning algorithms to determine winners in combinatorial double auctions"],"prefix":"10.1007","volume":"43","author":[{"given":"Fu-Shiung","family":"Hsieh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi-Shiang","family":"Liao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,25]]},"reference":[{"issue":"8","key":"643_CR1","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1016\/S0305-0548(03)00071-6","volume":"31","author":"J Abrache","year":"2004","unstructured":"Abrache J, Bourbeau B, Crainic TG, Gendreau M (2004) A new bidding framework for combinatorial e-auctions. Comput Oper Res 31(8):1177\u20131203","journal-title":"Comput Oper Res"},{"key":"643_CR2","doi-asserted-by":"crossref","unstructured":"Andersson A, Tenhunen M, Ygge F (2000) Integer programming for combinatorial auction winner determination. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence, pp 39\u201346","DOI":"10.1109\/ICMAS.2000.858429"},{"issue":"9","key":"643_CR3","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1287\/mnsc.47.9.1203.9781","volume":"47","author":"S Ba","year":"2001","unstructured":"Ba S, Stallaert J, Whinston AB (2001) Optimal investment in knowledge within a firm using a market-mechanism. Manag Sci 47(9):1203\u20131219","journal-title":"Manag Sci"},{"key":"643_CR4","doi-asserted-by":"crossref","unstructured":"Block C, Neumann D, Weinhardt C (2008) A Market Mechanism for Energy Allocation in Micro-CHP Grids. In: Proceedings of the 41st Hawaii International Conference on System Sciences, pp 1\u201311","DOI":"10.1109\/HICSS.2008.27"},{"issue":"10","key":"643_CR5","doi-asserted-by":"crossref","first-page":"2752","DOI":"10.1016\/j.cor.2008.12.006","volume":"36","author":"J Catal\u00e1n","year":"2009","unstructured":"Catal\u00e1n J, Epstein R, Guajardo M, Yung D, Mart\u0131nez C. (2009) Solving multiple scenarios in a combinatorial auction. Comput Oper Res 36(10):2752\u20132758","journal-title":"Comput Oper Res"},{"issue":"1","key":"643_CR6","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.eswa.2006.08.024","volume":"34","author":"JH Choi","year":"2008","unstructured":"Choi J H, Ahn H, Han I (2008) Utility-based double auction mechanism using genetic algorithms. Expert Syst Appl 34(1):150\u2013158","journal-title":"Expert Syst Appl"},{"issue":"3","key":"643_CR7","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S de Vries","year":"2003","unstructured":"de Vries S, Vohra RV (2003) R. Combinatorial Auctions:A Survey. INFORMS J Comput 15(3):284\u2013309","journal-title":"INFORMS J Comput"},{"key":"643_CR8","unstructured":"Fujishima Y, Leyton-Brown K, Shoham Y (1999) Taming the computational complexity of combinatorial auctions:Optimal and approximate approaches. In: Sixteenth International Joint Conference on Artificial Intelligence, pp 548\u2013553"},{"issue":"4","key":"643_CR9","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/2.755007","volume":"32","author":"M Fan","year":"1999","unstructured":"Fan M, Stallaert J, Whinston AB (1999) A web-based financial trading system. IEEE Comput 32(4):64\u201370","journal-title":"IEEE Comput"},{"issue":"12","key":"643_CR10","doi-asserted-by":"crossref","first-page":"1861","DOI":"10.1287\/mnsc.1040.0263","volume":"50","author":"ML Fisher","year":"2004","unstructured":"Fisher M L (2004) Lagrangian relaxation method for solving integer programming problems. Manag Sci 50(12):1861\u20131871","journal-title":"Manag Sci"},{"key":"643_CR11","doi-asserted-by":"crossref","unstructured":"Gonen R, Lehmann D (2000) Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics, The Proceedings of the Second ACM Conference on Electronic Commerce (EC\u201900), pp 13\u201320","DOI":"10.1145\/352871.352873"},{"key":"643_CR12","doi-asserted-by":"crossref","unstructured":"Guo Y, Lim A, Rodrigues B, Tang J (2005) Using a Lagrangian heuristic for a combinatorial auction problem. In: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence","DOI":"10.1109\/ICTAI.2005.126"},{"issue":"7","key":"643_CR13","doi-asserted-by":"crossref","first-page":"1271","DOI":"10.1016\/j.cor.2009.09.003","volume":"37","author":"P Harsha","year":"2010","unstructured":"Harsha P, Barnhart C, Parkes DC, Zhang H (2010) Strong activity rules for iterative combinatorial auctions. Comput Oper Res 37(7):1271\u20131284","journal-title":"Comput Oper Res"},{"key":"643_CR14","unstructured":"Hoos HH, Boutilier C (2000) Solving combinatorial auctions using stochastic local search. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence:22\u201329"},{"key":"643_CR15","unstructured":"Hsieh F.S., Liao C.-S. (2012) Surplus Optimization in Combinatorial Double Auctions. Proceedings of The 6th International Conference on New Trends in Information Science and Service Science, pp 330\u2013335"},{"key":"643_CR16","doi-asserted-by":"crossref","unstructured":"Hsieh FS, Tsai SM (2008) Combinatorial Reverse Auction based on Lagrangian Relaxation, Proceedings of 2008 IEEE Asia-Pacific Services Computing Conference, pp 329-334","DOI":"10.1109\/APSCC.2008.112"},{"issue":"2","key":"643_CR17","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.dss.2009.08.009","volume":"48","author":"FS Hsieh","year":"2010","unstructured":"Hsieh FS (2010) Combinatorial reverse auction based on revelation of Lagrangian multipliers. Decis Support Syst 48(2):323\u2013330","journal-title":"Decis Support Syst"},{"issue":"4","key":"643_CR18","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/j.elerap.2012.02.003","volume":"11","author":"FS Hsieh","year":"2012","unstructured":"Hsieh FS, Lin JB (2012) Assessing the benefits of group-buying-based combinatorial reverse auctions. Electron Commer Res Appl 11(4):407\u2013419","journal-title":"Electron Commer Res Appl"},{"issue":"5\u20138","key":"643_CR19","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1007\/s00170-011-3843-z","volume":"62","author":"FS Hsieh","year":"2012","unstructured":"Hsieh FS, Lin JB (2012) Virtual enterprises partner selection based on reverse auctions. Int J Adv Manuf Technol 62(5\u20138):847\u2013859","journal-title":"Int J Adv Manuf Technol"},{"key":"643_CR20","unstructured":"IBM ILOG CPLEX Optimizer (2012). http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/"},{"issue":"1","key":"643_CR21","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0167-9236(02)00004-0","volume":"34","author":"JL Jones","year":"2002","unstructured":"Jones JL, Koehler GJ (2002) Combinatorial auctions using rule-based bids. Decis Support Syst 34(1):59\u201374","journal-title":"Decis Support Syst"},{"issue":"2","key":"643_CR22","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/j.dss.2006.10.009","volume":"43","author":"R Leskel\u00e4","year":"2007","unstructured":"Leskel\u00e4 R, Teich J, Wallenius H, Wallenius J (2007) Decision support for multi-unit combinatorial bundle auctions. Decis Support Syst 43(2):420\u2013434","journal-title":"Decis Support Syst"},{"key":"643_CR23","first-page":"3647","volume":"5539","author":"L Li","year":"2009","unstructured":"Li L, Liu Y, Hausheer D, Stiller B (2009a) Design and evaluation of a combinatorial double auction for resource allocations in grids. Lect Notes Comput Sci 5539:3647","journal-title":"Lect Notes Comput Sci"},{"issue":"3","key":"643_CR24","first-page":"5965","volume":"16","author":"L Li","year":"2009","unstructured":"Li L, Liu Y, Liu K, Ma X, Yang M (2009b) Pricing in combinatorial double auction-based grid allocation model. J China Univ Posts Telecommun 16(3):5965","journal-title":"J China Univ Posts Telecommun"},{"issue":"3","key":"643_CR25","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1016\/j.ejor.2008.04.031","volume":"196","author":"L Meeus","year":"2009","unstructured":"Meeus L, Verhaegen K, Belmans R (2009) Block order restrictions in combinatorial electric energy auctions. Eur J Oper Res 196(3):1202\u20131206","journal-title":"Eur J Oper Res"},{"issue":"5","key":"643_CR26","doi-asserted-by":"crossref","first-page":"504523","DOI":"10.1109\/4235.956714","volume":"5","author":"J Nicolaisen","year":"2001","unstructured":"Nicolaisen J, Petrov V, Tesfatsion L (2001) Market power and efficiency in a computational electricity market with discriminatory double-auction pricing. IEEE Trans Evol Comput 5(5):504523","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"643_CR27","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.cor.2007.08.003","volume":"36","author":"AH \u00d6zer","year":"2009","unstructured":"\u00d6zer A H, \u00d6zturan C (2009) A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction. Comput Oper Res 36(1):196\u2013208","journal-title":"Comput Oper Res"},{"issue":"11","key":"643_CR28","doi-asserted-by":"crossref","first-page":"14851503","DOI":"10.1287\/mnsc.49.11.1485.20585","volume":"49","author":"A Peke\u010d","year":"2003","unstructured":"Peke\u010d A, Rothkopf MH (2003) Combinatorial auction design. Management Science 49(11):14851503","journal-title":"Management Science"},{"key":"643_CR29","unstructured":"Perugini D, Lambert D, Sterling L, Pearce A (2005) From Single Static to Multiple Dynamic Combinatorial Auctions, Intelligent Agent Technology, IEEE\/WIC\/ACM International Conference on 19-22, September, 2005, pp 443446"},{"key":"643_CR30","doi-asserted-by":"crossref","unstructured":"Polyak B T (1969) Minimization of unsmooth functionals. USSR Computational Math Math Phys 9:14\u201329","DOI":"10.1016\/0041-5553(69)90061-5"},{"issue":"8","key":"643_CR31","doi-asserted-by":"crossref","first-page":"11311147","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M Rothkopf","year":"1998","unstructured":"Rothkopf M, Peke\u010d A, Harstad R (1998) Computationally manageable combinational auctions. Management Science 44(8):11311147","journal-title":"Management Science"},{"key":"643_CR32","unstructured":"Sandholm T (1999) An algorithm for optimal winner determination in combinatorial auctions. In: Proc. IJCAI\u201999, Stockholm , p 542547"},{"issue":"1\u20132","key":"643_CR33","first-page":"165176","volume":"28","author":"T Sandholm","year":"2000","unstructured":"Sandholm T (2000) Approaches to winner determination in combinatorial auctions. Dec Support Syst 28(1\u20132):165176","journal-title":"Dec Support Syst"},{"issue":"1\u20132","key":"643_CR34","first-page":"154","volume":"135","author":"T Sandholm","year":"2002","unstructured":"Sandholm T (2002) Algorithm for optimal winner determination in combinatorial auctions. Artif Intell 135(1\u20132):154","journal-title":"Artif Intell"},{"issue":"2","key":"643_CR35","doi-asserted-by":"crossref","first-page":"799808","DOI":"10.1016\/j.ejor.2008.07.049","volume":"197","author":"H Schellhorn","year":"2009","unstructured":"Schellhorn H (2009) A double-sided multiunit combinatorial auction for substitutes: Theory and algorithms. Eur J Oper Res 197(2):799808","journal-title":"Eur J Oper Res"},{"key":"643_CR36","doi-asserted-by":"crossref","unstructured":"Vemuganti RR (1998) Applications of set covering, set packing and set partitioning models: a survey . In: Du D-Z (ed) Handbook of Combinatorial Optimization, vol 1. Kluwer Academic Publishers, p 573746. Netherlands","DOI":"10.1007\/978-1-4613-0303-9_9"},{"issue":"18","key":"643_CR37","first-page":"7","volume":"28","author":"XJ Wang","year":"2004","unstructured":"Wang XJ, Yin H (2004) An incentive compatible double auction mechanism in electricity market. Autom Power Syst 28(18):7\u201315","journal-title":"Autom Power Syst"},{"issue":"1","key":"643_CR38","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.ejor.2003.11.018","volume":"164","author":"M Xia","year":"2005","unstructured":"Xia M, Stallaert J, Whinston AB (2005) Solving the combinatorial double auction problem. Eur J Oper Res 164(1):239\u2013251","journal-title":"Eur J Oper Res"},{"issue":"1","key":"643_CR39","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.cor.2007.08.001","volume":"36","author":"S Yang","year":"2009","unstructured":"Yang S, Segre AM, Codenotti B (2009) An optimal multiprocessor combinatorial auction solver. Comput Oper Res 36(1):149\u2013166","journal-title":"Comput Oper Res"},{"issue":"2","key":"643_CR40","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1109\/TAC.1986.1104206","volume":"31","author":"R Akella","year":"1986","unstructured":"Akella R, Kumar PR (1986) Optimal control of production rate in a failure-prone manufacturing systems. IEEE Trans Autom Control 31(2):116\u2013126","journal-title":"IEEE Trans Autom Control"},{"key":"643_CR41","volume-title":"Manufacturing Systems Engineering","author":"SB Gershwin","year":"1994","unstructured":"Gershwin SB (1994) Manufacturing Systems Engineering. Prentice-Hall, Englewood Cliffs"},{"issue":"4","key":"643_CR42","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1080\/05695558308974659","volume":"15","author":"J Kimemia","year":"1983","unstructured":"Kimemia J, Gershwin SB (1983) An algorithm for the computer control of a fexible manufacturing system. IIE Trans 15(4):353\u2013362","journal-title":"IIE Trans"},{"key":"643_CR43","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01158930","volume":"13","author":"PR Kumar","year":"1993","unstructured":"Kumar PR (1993) Re-entrant lines. Queueing Syst: Theory Appl 13:87\u2013110","journal-title":"Queueing Syst: Theory Appl"},{"issue":"2","key":"643_CR44","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/j.cor.2004.06.005","volume":"33","author":"E Altman","year":"2005","unstructured":"Altman E, Boulogne T, El Azouzi R, Jim\u00e9nez T, Wynter L (2005) A survey on networking games in telecommunications. Comput Oper Res 33(2):286\u2013311","journal-title":"Comput Oper Res"},{"key":"643_CR45","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1287\/opre.46.6.776","volume":"46","author":"E Altman","year":"1998","unstructured":"Altman E, Shimkin N (1998) Individual equilibrium and learning in processor sharing systems. Oper Res 46:776\u2013784","journal-title":"Oper Res"},{"issue":"3","key":"643_CR46","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1109\/9.989076","volume":"47","author":"R La","year":"2002","unstructured":"La R, Anantharam V (2002) Optimal routing control: Repeated game approach. IEEE Trans Autom Control 47(3):437\u2013450","journal-title":"IEEE Trans Autom Control"},{"issue":"5","key":"643_CR47","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1109\/90.251910","volume":"1","author":"A Orda","year":"1993","unstructured":"Orda A, Rom R, Shimkin N (1993) Competitive routing in multi-user communication networks. IEEE\/ACM Trans Netw 1(5):510\u2013521","journal-title":"IEEE\/ACM Trans Netw"},{"key":"643_CR48","doi-asserted-by":"crossref","unstructured":"Roughgarden T, Selish Routing and the Price of Anarchy (2005). MIT Press, Cambridge","DOI":"10.21236\/ADA637949"},{"issue":"7","key":"643_CR49","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/j.artint.2006.12.006","volume":"171","author":"GeoffreyJ Gordon","year":"2007","unstructured":"Gordon Geoffrey J (2007) Agendas for multi-agent learning. Artif Intell 171(7):392\u2013401","journal-title":"Artif Intell"},{"issue":"3","key":"643_CR50","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10458-005-2631-2","volume":"11","author":"L Panait","year":"2005","unstructured":"Panait L, Luke S (2005) Cooperative multi-agent learning: the state of the art. Auton Agent Multi-Agent Syst 11(3):387\u2013434","journal-title":"Auton Agent Multi-Agent Syst"},{"key":"643_CR51","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-319-07455-9_1","volume":"8481","author":"FS Hsieh","year":"2014","unstructured":"Hsieh FS, Liao C-S (2014) Multi-agent Learning for Winner Determination in Combinatorial Auctions. Lect Notes Comput Sci 8481:1\u201310","journal-title":"Lect Notes Comput Sci"},{"key":"643_CR52","volume-title":"Multi-Agent Systems, An Introduction to Distributed Artificial Intelligence","author":"J Ferber","year":"1999","unstructured":"Ferber J (1999) Multi-Agent Systems, An Introduction to Distributed Artificial Intelligence. Addison Wesley, Reading"},{"key":"643_CR53","volume-title":"Artificial intelligence: A new synthesis","author":"NJ Nilsson","year":"1998","unstructured":"Nilsson NJ (1998) Artificial intelligence: A new synthesis. Morgan Kaufmann Publishers Inc, San Francisco"},{"issue":"3","key":"643_CR54","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1023\/A:1008942012299","volume":"8","author":"Peter Stone","year":"2000","unstructured":"Stone Peter, Veloso Manuela (2000) Multiagent Systems: A Survey from a Machine Learning Perspective. Autonom Robots 8(3):345\u2013383","journal-title":"Autonom Robots"},{"issue":"4","key":"643_CR55","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/s10489-012-0350-3","volume":"37","author":"C Su","year":"2012","unstructured":"Su C, Li H (2012) An affective learning agent with Petri-net-based implemen-tation. Appl Intell 37(4):569\u2013585","journal-title":"Appl Intell"},{"issue":"3","key":"643_CR56","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10458-005-2631-2","volume":"11","author":"L Panait","year":"2005","unstructured":"Panait L., Luke S. (2005) Cooperative Multi-Agent Learning:The State of the Art. Auton Agent Multi-Agent Syst 11(3):387\u2013434","journal-title":"Auton Agent Multi-Agent Syst"},{"key":"643_CR57","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/11691839_1","volume":"3898","author":"PJ \u2019t Hoen","year":"2006","unstructured":"\u2019t Hoen PJ, Tuyls K, Panait L, Luke S, La Poutre JA (2006) An overview of cooperative and competitive multiagent learning. Lect Notes Comput Sci 3898:1\u201346","journal-title":"Lect Notes Comput Sci"},{"key":"643_CR58","unstructured":"Barto A, Sutton R , Watkins C (1991) Learning and sequential decision making. In: Gabriel M, Moore J (eds) Learning and computational neuroscience : foundations of adaptive networks. The M.I.T. Press."},{"key":"643_CR59","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1613\/jair.301","volume":"4","author":"L Kaelbling","year":"1996","unstructured":"Kaelbling L, Littman M, Moore A (1996) Reinforcement learning: A survey. J Artif Intell Res 4:237\u2013285","journal-title":"J Artif Intell Res"},{"key":"643_CR60","first-page":"9","volume":"3","author":"R Sutton","year":"1988","unstructured":"Sutton R (1988) Learning to predict by the methods of temporal differences. Mach Learn 3:9\u201344","journal-title":"Mach Learn"},{"key":"643_CR61","unstructured":"Haynes T, Lau K, Sen S (1996) Learning cases to compliment rules for conflict resolution in multiagent systems. In: Sen S (ed) AAAI Spring Symposium on Adaptation. Coevolution, and Learning in Multiagent Systems, pp 51\u201356"},{"key":"643_CR62","volume-title":"Adaptation and Learning in Multiagent Systems, Lecture Notes in Artificial Intelligence","author":"T Haynes","year":"1995","unstructured":"Haynes T, Sen S (1995) Evolving behavioral strategies in predators and prey. In: Wei\u00df G , Sen S (eds) Adaptation and Learning in Multiagent Systems, Lecture Notes in Artificial Intelligence. Springer Verlag, Germany"},{"key":"643_CR63","first-page":"23","volume-title":"Working Notes for the AAAI Symposium on Genetic Programming","author":"T Haynes","year":"1995","unstructured":"Haynes T, Sen S, Schoenefeld D, Wainwright R (1995) Evolving a team. In: Siegel EV, Koza JR (eds) Working Notes for the AAAI Symposium on Genetic Programming. MIT, Cambridge, pp 23\u201330 . 10\u201312 Nov. AAAI"},{"key":"643_CR64","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/3-540-61723-X_967","volume-title":"Parallel Problem Solving from Nature IV: Proceedings of the International Conference on Evolutionary Computation volume 1141 of LNCS","author":"H Iba","year":"1996","unstructured":"Iba H (1996) Emergent cooperation for multiple agents using genetic programming. In: Voigt H-M, Ebeling W, Rechenberg I , Schwefel H-P (eds) Parallel Problem Solving from Nature IV: Proceedings of the International Conference on Evolutionary Computation volume 1141 of LNCS. Springer Verlag, Germany, pp 32\u201341. ISBN 3-540-61723-X"},{"key":"643_CR65","doi-asserted-by":"crossref","unstructured":"Iba H (1998) Evolutionary learning of communicating agents. Inf Sci:108","DOI":"10.1016\/S0020-0255(97)10055-X"},{"key":"643_CR66","unstructured":"von Neumann J, Morgenstern O (1944) The Theory of Games and Economic Behavior. Princeton University Press"},{"key":"643_CR67","unstructured":"Owen G. (1982) Game Theory, 2nd Edn. Academic Press"},{"key":"643_CR68","unstructured":"Straffin PD (1993) Game Theory and Strategy. Mathematical Association of America"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0643-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-014-0643-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0643-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T01:20:47Z","timestamp":1566350447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-014-0643-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,25]]},"references-count":68,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["643"],"URL":"https:\/\/doi.org\/10.1007\/s10489-014-0643-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,25]]}}}