{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:47Z","timestamp":1725484307840},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439417"},{"type":"electronic","value":"9783540456223"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45622-8_28","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T18:45:20Z","timestamp":1179945920000},"page":"328-329","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Techniques in Multiagent Learning"],"prefix":"10.1007","author":[{"given":"Michael","family":"Bowling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,9]]},"reference":[{"key":"28_CR1","unstructured":"Michael Bowling and Manuela Veloso. Bounding the suboptimality of reusing subproblems. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pages 1340\u20131345, Stockholm, Sweden, August 1999. Morgan Kaufman."},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Michael Bowling and Manuela Veloso. Multiagent learning using a variable learning rate. Artificial Intelligence, 2002. In Press.","DOI":"10.1016\/S0004-3702(02)00121-2"},{"key":"28_CR3","unstructured":"Michael Bowling and Manuela M. Veloso. Existence of multiagent equilibria with limited agents. Technical report CMU-CS-02-104, Computer Science Department, Carnegie Mellon University, 2002."},{"key":"28_CR4","unstructured":"[Bowling et al. 2002]_Michael Bowling, Rune Jensen, and Manuela Veloso. A formalization of equilibria for multiagent planning. In AAAI Workshop on Planning with and for Multiagent Systems, Edmonton, Canada, July 2002. To Appear."}],"container-title":["Lecture Notes in Computer Science","Abstraction, Reformulation, and Approximation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45622-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T21:34:31Z","timestamp":1550352871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45622-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439417","9783540456223"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-45622-8_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}