{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T18:36:09Z","timestamp":1758393369613},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,3,9]],"date-time":"2006-03-09T00:00:00Z","timestamp":1141862400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2006,6]]},"DOI":"10.1007\/s10994-006-6225-2","type":"journal-article","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T17:05:52Z","timestamp":1143565552000},"page":"287-327","source":"Crossref","is-referenced-by-count":21,"title":["Learning to bid in bridge"],"prefix":"10.1007","volume":"63","author":[{"given":"Asaf","family":"Amit","sequence":"first","affiliation":[]},{"given":"Shaul","family":"Markovitch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,3,9]]},"reference":[{"key":"6225_CR1","doi-asserted-by":"crossref","unstructured":"Ando, T., Kobayashi, N., & Uehara. T. (2003). Cooperation and competition of agents in the auction of computer bridge. Electronics and Communications in Japan, 86(12).","DOI":"10.1002\/ecjc.10144"},{"key":"6225_CR2","unstructured":"Belladonna, G., & Garozzo. B. (1975). Precision & super precision bidding. Cassell, London."},{"key":"6225_CR3","unstructured":"Billings, D., Burch, N., Davidson, A., Holte, R., Schaeffer, J., Schauenberg, T., & Szafron, D. (2003). Approximating game-theoretic optimal strategies for fullscale poker. In: Proceedings of the Eighteens International Joint Conference on Artificial Intelligence (pp. 661\u2013668)."},{"key":"6225_CR4","doi-asserted-by":"crossref","unstructured":"Billings, D., Davidson, A., Schaeffer, J., & Szafron, D. (2002). The challenge of poker. Artificial Intelligence 134:1-2, 201\u2013240.","DOI":"10.1016\/S0004-3702(01)00130-8"},{"key":"6225_CR5","unstructured":"Billings, D., Papp, D., Schaeffer, J., & Szafron, D. (1998). Opponent modeling in poker. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence. (pp. 493\u2013499)."},{"key":"6225_CR6","unstructured":"Billings, D., Pena, L., Schaeffer, J., & Szafron, D. (1998). Using probabilistic knowledge and simulation to play poker. In: Proceedings of the Sixteenth National Conference on Artificial Intelligence (pp. 697\u2013703)."},{"key":"6225_CR7","unstructured":"Bird, R., (1999). BTM\u2019s first steps into computing. Computer Resurrection: The Bulletin of the Computer Conservation Society, 22, 12\u201318."},{"key":"6225_CR8","unstructured":"Bruce, J., Bowling, M., Browning, B., & Veloso, M. (2002). Multi-robot team response to a multi-robot opponent team. In: Proceedings of the 2003 IEEE International Conference on Robotics and Automation (pp. 2281\u20132286)."},{"key":"6225_CR9","unstructured":"Carley, G. (1962). A program to play contract bridge. Master\u2019s thesis, Dept. of Electrical Engineering, Massachussets Institute of Technology, Cambridge, Massachussets."},{"key":"6225_CR10","unstructured":"Carmel, D., & Markovitch, S. (1996a). Incorporating opponent models into adversary search. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence (pp. 120\u2013125). Portland, Oregon."},{"key":"6225_CR11","unstructured":"Carmel, D., & Markovitch, S. (1996b). Learning and using opponent models in adversary search. Technical Report CIS9609, Technion."},{"key":"6225_CR12","doi-asserted-by":"crossref","unstructured":"Carmel, D., & Markovitch, S. (1998). Model-based learning of interaction strategies in multi-agent systems. Journal of Experimental and Theoretical Artificial Intelligence, 10:3, 309\u2013332.","DOI":"10.1080\/095281398146789"},{"key":"6225_CR13","unstructured":"Cohen, L. (2002). Larry Cohen\u2019s bidding challenge. Master Point Print, Toronto."},{"key":"6225_CR14","unstructured":"Davidson, A., Billings, D., Schaeffer, J., & Szafron, D. (2000). Improved opponent modeling in poker. In: Proceedings of the 2000 International Conference on Artificial Intelligence (pp. 1467\u20131473)."},{"key":"6225_CR15","unstructured":"Donkers, H. (2003). Nosce Hostem \u2013- Searching with opponent models. Ph.D. thesis, Universiteit Maastricht."},{"key":"6225_CR16","doi-asserted-by":"crossref","unstructured":"Donkers, H., Uiterwijk, J., & van, den Herik, H. (2001). Probabilistic opponent-model search. Information Sciences, 135:3-4, 123\u2013149.","DOI":"10.1016\/S0020-0255(01)00133-5"},{"key":"6225_CR17","unstructured":"Eskes, O. (1998). The par contest. Imp Magazine, 9 (7)."},{"key":"6225_CR18","doi-asserted-by":"crossref","unstructured":"Feigenbaum, E., & Simon, H. (1984). EPAM-like models of recognition and learning. Cognitive Science, 8:43, 305\u2013336.","DOI":"10.1207\/s15516709cog0804_1"},{"key":"6225_CR19","doi-asserted-by":"crossref","unstructured":"Finkelstein, L., & Markovitch, S. (1998). Learning to play chess selectively by acquiring move patterns. ICCA Journal, 21:2, 100\u2013119.","DOI":"10.3233\/ICG-1998-21204"},{"key":"6225_CR20","unstructured":"Frank, I. (1998). Search and planning under incomplete information: study using bridge card play. Springer."},{"key":"6225_CR21","unstructured":"Gamb\u00e4ck, B., Rayner, M., & Pell, B. (1993). Pragmatic reasoning in bridge. Technical Report CRC-030, SRI International Cambridge Computer Science Reasearch Center."},{"key":"6225_CR22","doi-asserted-by":"crossref","unstructured":"Gao, X. Iida, H. Uiterwijk, J., & van den Herik. H. J. (1999). A speculative strategy. Lecture Notes in Computer Science, 1558, 74\u201392.","DOI":"10.1007\/3-540-48957-6_5"},{"key":"6225_CR23","doi-asserted-by":"crossref","unstructured":"Ginsberg, M. L. (2001). GIB: Imperfect information in a computationally challenging game. Journal of Artificial Intelligence Research, 14, 303\u2013358.","DOI":"10.1613\/jair.820"},{"key":"6225_CR24","unstructured":"Goldman, B. (1978). Aces scientific. Max Hardy."},{"key":"6225_CR25","doi-asserted-by":"crossref","unstructured":"Hyatt, R. M. (1999). Book learning \u2013 A methodology to tune an opening book automatically. International Computer Chess Association Journal, 22:1, 3\u201312.","DOI":"10.3233\/ICG-1999-22102"},{"key":"6225_CR26","unstructured":"Iida, H., Uiterwijk, J. W., & van den Herik, H. (2000). Cooperative strategies for pair playing. In: H. van den Herik and H. Iida (eds.), Games in AI Research. Universiteit Maastricht (pp. 189\u2013201)."},{"key":"6225_CR27","unstructured":"Iida, H., Uiterwijk, J. W. H., van den Herik, H. J., & Herschberg, I. S., (1993). Potential applications of opponent-model search, Part I: The domain of applicability. ICCA Journal, 16:4, 201\u2013208."},{"key":"6225_CR28","unstructured":"Iida, H., Uiterwijk, J. W. H., van den Herik, H. J., & Herschberg, I. S. (1994). Potential applications of opponent-model search, Part II: risks and strategies. ICCA Journal, 17:1, 10\u201314."},{"key":"6225_CR29","unstructured":"Jamroga, W. (1999). Modelling artificial intelligence on a case of bridge card play bidding. In: Proceedings of the 8th International Workshop on Intelligent Information Systems (pp. 267\u2013277) Ustron, Poland."},{"key":"6225_CR30","doi-asserted-by":"crossref","unstructured":"Jamroga, W. (2001). A defense model for games with incomplete information. Lecture Notes in Computer Science, 2174, 260\u2013274.","DOI":"10.1007\/3-540-45422-5_19"},{"key":"6225_CR31","unstructured":"Jansen, P. J. (1992). Using knowledge about the opponent in game-tree search. Ph.D. thesis, Carnegie Mellon University."},{"key":"6225_CR32","unstructured":"Klinger, R. (2001). Modern losing trick count. Orion."},{"key":"6225_CR33","unstructured":"Levy, D. (1989). The million pound bridge program. In: D. Levy and D. Beal (eds.), Heuristic programming in artificial intelligence\u2014First Computer Olympiad (pp. 93\u2013105)."},{"key":"6225_CR34","unstructured":"Lindel\u00f6f, E. (1983). COBRA\u2014The computer-designed bidding system. England: Victor Gollancz."},{"key":"6225_CR35","unstructured":"Luckhardt, C. A., & Irani, K. B. (1986). An algorithmic solution of N-person games. In: Proceedings of the Ninth National Conference on Artificial Intelligence (pp. 158\u2013162). Philadelfia, PA."},{"key":"6225_CR36","doi-asserted-by":"crossref","unstructured":"Lustrek, M., Gams, M., & Bratko, I. (2003). A program for playing tarok. ICGA Journal, 26:3, 190\u2013197.","DOI":"10.3233\/ICG-2003-26305"},{"key":"6225_CR37","unstructured":"Macleod, J. (1989). Microbridge\u2014A Computer Developed Approach to Bidding. In: D. Levy and D. Beal (eds.), Heuristic programming in artificial intelligence\u2014the first computer olympiad (pp. 81\u201387)."},{"key":"6225_CR38","unstructured":"Mahmood, Z. (1994). Bridge my way. Natco Press."},{"key":"6225_CR39","doi-asserted-by":"crossref","unstructured":"Markovitch, S., & Reger, R. (2005). Learning and exploiting relative weaknesses of opponent agents. Autonomous Agents and Multi-agent Systems, 10:2, 103\u2013130.","DOI":"10.1007\/s10458-004-6977-7"},{"key":"6225_CR40","doi-asserted-by":"crossref","unstructured":"Markovitch, S., & Sella, Y. (1996). Learning of resource allocation strategies for game playing. Computational Intelligence, 12:1, 88\u2013105.","DOI":"10.1111\/j.1467-8640.1996.tb00254.x"},{"key":"6225_CR41","doi-asserted-by":"crossref","unstructured":"Samuel, A. L. (1959). Some studies in machine learning using the game of checkers. IBM Journal of Research and Development, 3:3, 211\u2013229.","DOI":"10.1147\/rd.33.0210"},{"key":"6225_CR42","unstructured":"Schaeffer, J. (2000). The games computers (and People) play. In: Marvin Zelkowitz (ed.), Advances in computer 50, (pp. 189\u2013266). Academic Press."},{"key":"6225_CR43","unstructured":"Scott, P. D., & Markovitch, S. (1991). Representation generation in an exploratory learning system. In: D. Fisher and M. Pazzani (eds.), Concept formation: Knowledge and experience in unsupervised learning. Morgan Kaufmann."},{"key":"6225_CR44","doi-asserted-by":"crossref","unstructured":"Scott, P. D., & Markovitch, S. (1993). Experience selection and problem choice in an exploratory learning system. Machine Learning, 12, 49\u201367.","DOI":"10.1007\/BF00993060"},{"key":"6225_CR45","unstructured":"Sen, S., & Arora, N. (1997). Learning to take risks. In: AAAI-97 Workshop on Multiagent Learning. (pp. 59\u201364)."},{"key":"6225_CR46","unstructured":"Sen, S., & Sekaran, M. (1998). Individual learning of coordination knowledge. Journal of Experimental & Theoretical Artificial Intelligence 10:3, (p. 333\u2013356)."},{"key":"6225_CR47","doi-asserted-by":"crossref","unstructured":"Shi, J., & Littman, M. (2001). Abstraction models for game theoretic poker. Computers and Games, (pp. 333\u2013345).","DOI":"10.1007\/3-540-45579-5_22"},{"key":"6225_CR48","doi-asserted-by":"crossref","unstructured":"Smith, S. J. J., Nau, D., & Throop, T. (1996). A planning approach to declarer play in contract bridge. Computational Intelligence, 12:1, 106\u2013130.","DOI":"10.1111\/j.1467-8640.1996.tb00255.x"},{"key":"6225_CR49","unstructured":"Smith, S. J. J., Nau, D., & Throop, T. (1998a). Computer bridge: A big win for AI planning. AI Magazine, 2:19, 93\u2013105."},{"key":"6225_CR50","unstructured":"Smith, S. J. J., Nau, D., & Throop, T. (1998b). Success in spades: Using AI planning techniques to win the world championship of computer bridge. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence, (pp. 1079\u20131086)."},{"key":"6225_CR51","unstructured":"Stanier, A. M.. (1975). BRIBIP: A bridge bidding program. In: The Proceedings of the Fourth International Joint Conference on Artificial Intelligence (pp. 374\u2013378)."},{"key":"6225_CR52","unstructured":"Sturtevant, N. (2004). Current challenges in multi-player game search. In: Proceedings of Computers and Games. Israel."},{"key":"6225_CR53","doi-asserted-by":"crossref","unstructured":"Wasserman, A. (1970). Realization of a skillful bridge bidding program. Fall Joint Computer Conference, (pp. 433\u2013444). Houston, Texas.","DOI":"10.1145\/1478462.1478525"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-006-6225-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-006-6225-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-006-6225-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:40:20Z","timestamp":1559353220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-006-6225-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3,9]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["6225"],"URL":"https:\/\/doi.org\/10.1007\/s10994-006-6225-2","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3,9]]}}}