{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:47:30Z","timestamp":1725486450142},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540413486"},{"type":"electronic","value":"9783540444114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44411-4_5","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T22:52:31Z","timestamp":1182207151000},"page":"56-70","source":"Crossref","is-referenced-by-count":8,"title":["Algorithms for Rational Agents"],"prefix":"10.1007","author":[{"given":"Amir","family":"Ronen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,1,22]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"E. H. Clarke. Multipart pricing of public goods. Public Choice, pages 17\u201333, 1971. 63","DOI":"10.1007\/BF01726210"},{"key":"5_CR2","unstructured":"Bern ardo Huberman (ed.). The Ecology of Computation. Elsevier Science Publishers\/North-Holland, 1988. 67"},{"key":"5_CR3","unstructured":"Eit han Ephrati. Planning and consensus among autonomous agents. Ph D thesis, Hebrew University of Jerusalem, Departement of Computer Science, 1993. 67"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"J oan Feigenbaum, Christos Papadimitriou, and Scott Shenker. Sharing the cost of multicast transmissions. In Thirty-Second Annual ACM Symposium on Theory of Computing (STOC00), May 2000. 67","DOI":"10.1145\/335305.335332"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Donald F. Ferguson, Christos Nikolaou, and Yechiam Yemini. Economic models for allocating resources in computer systems. In Scott Clearwater, editor, Market-Based Control: A Paradigm for Distributed Resource Allocation. World Scientific, 1995. 67","DOI":"10.1142\/9789814261371_0007"},{"key":"5_CR6","unstructured":"Y uzo Fujishima, Kevin Leyton-Brown, and Yoav Shoham.Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In IJCAI-99, 1999. 64, 65"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"T. Groves. Incentives in teams. Econometrica, pages 617\u2013631, 1973. 63","DOI":"10.2307\/1914085"},{"key":"5_CR8","unstructured":"R. M. Harstad, Rothkopf M. H., and Pekec A. Computationally manageable combinatorial auctions.Technical Report 95-09, DIMACS, Rutgers university, 1995. 64, 65"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Brnardo A. Huberman and Tad Hogg. Distributed computation as an economic system. Journal of Economic Perspectives, pages 141\u2013152, 1995. 67","DOI":"10.1257\/jep.9.1.141"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Paul Klemperer. Auction theory: a guide to the literature. Journal of economic surveys, pages 227\u2013286, 1999.","DOI":"10.1111\/1467-6419.00083"},{"issue":"7","key":"5_CR11","first-page":"1241","volume":"13","author":"Y. A. Korilis","year":"1991","unstructured":"Y. A Korilis, A. A. Lazar, and A. Orda. Architecting noncooperative networks. IEEE Journal on Selected Areas in Communication (Special Issue on Advances in the Fundamentals of Networking), 13(7):1241\u20131251, September 1991. 67","journal-title":"IEEE Journal on Selected Areas in Communication (Special Issue on Advances in the Fundamentals of Networking)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Elias Koutsoupias and Christos Papadimitriou. Worst-case equilibria. In STACS 99, the 16th Annual Symposium on Theoretical Aspects of Computer Science, March 1999. 67","DOI":"10.1007\/3-540-49116-3_38"},{"key":"5_CR13","unstructured":"Ron Lavi and Noam Nisan. Competitive analysis of online auctions. To appear. 67"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Daniel Lehmann, Liadan O\u2019Callaghan, and Yoav Shoham. Truth revelation in rapid, approximately efficient combinatorial auctions. In ACM Conference on Electronic Commerce (EC-99), pages 96\u2013102, November 1999. 64, 65","DOI":"10.1145\/336992.337016"},{"key":"5_CR15","unstructured":"Kevin Leyton-Brown, Moshe Tennenholtz, and Yoav Shoham. Bidding clubs: Institutionalized collusion in auctions. To appear. 67"},{"key":"5_CR16","unstructured":"A. Mas-Collel, Whinston W., and J. Green. Microeconomic Theory. Oxford university press, 1995. 61, 63"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"J. McMillan. Selling spectrum rights. Journal of Economic Perspectives, pages 145\u2013162, 1994. 64","DOI":"10.1257\/jep.8.3.145"},{"key":"5_CR18","unstructured":"Welleman Michael. Mark et-oriented programming. Web Page: http:\/\/ai.eecs.umich.edu\/people\/wellman\/MOP.html . 67"},{"key":"5_CR19","unstructured":"Dov Monderer and Moshe Tennenholtz. Distributed games. To appear in Games and Economic Behaviour. 67"},{"key":"5_CR20","unstructured":"Dov Monderer and Moshe Tennenholtz.Opti mal auctions revisited. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98), 1998. 67"},{"key":"5_CR21","unstructured":"Miller M. S. and Drexler K. E. The Ecology of Computation, chapter Markets and Computation: Agoric open systems. North Hollan, 1988. 67"},{"key":"5_CR22","unstructured":"Noam Nisan. Bid ding and allocation in combinatorial auctions. To appear. 64, 65"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Noam Nisan and Amir Ronen. Algorithmic mechanism design (extended abstract). In The Thirty First Annual ACM symposium om Theory of Computing (STOC99), pages 129\u2013140, May 1999. 66, 67","DOI":"10.1145\/301250.301287"},{"key":"5_CR24","unstructured":"Noam Nisan and Amir Ronen. A lgorithmic mechanism design. Games and Economic Behaviour, 2000. To appear. 63, 66"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Noam Nisan and Amir Ronen. Computationally feasible vcg mechanisms. Submitted to the Second ACM conference on electronic commerce (EC00), 2000. 65","DOI":"10.1145\/352871.352898"},{"key":"5_CR26","unstructured":"Kevin Roberts.The characterization of implementable choise rules. In Jean-Jacques Laffont, editor, Aggregation and Revelation of Preferences, pages 321\u2013349. North-Holland, 1979. Papers presented at the first European Summer Workshop of the Econometric Society. 63"},{"key":"5_CR27","unstructured":"Amir Ronen. Solving optimization problems among selfish agents. Ph D thesis, School of Computer Science and Engineering, The Hebrew University of Jerusalem, 2000. 65, 66"},{"key":"5_CR28","unstructured":"Jeffrey S. Rosenschein and Gilad Zlotkin. Rules of Encounter: Designing Conventions for Automated Negotiation Among Computers. MIT Press, 1994. 67"},{"key":"5_CR29","unstructured":"Tuomas W. Sandholm. Limitations of the vickrey auction in computational multiagent systems. In Proceedings of the Second International Conference on Multiagent Systems (ICMAS-96), pages 299\u2013306, Keihanna Plaza, Kyoto, Japan, December 1996. 67"},{"key":"5_CR30","unstructured":"Tuomas W. Sandholm. Approaches to winner determination in combinatorial auctions. Decision Support Systems, to appear. 64, 65"},{"key":"5_CR31","unstructured":"Y. Shoham and Tennenholtz M. Rational computation and the coomunication complexity of auctions. To appear. 67"},{"key":"5_CR32","unstructured":"Yoav Shoham and Katsumi Tanaka. A dynamic theory of incentives in multi-agent systems (preliminary report). In Proceedings of the Fifteenth International Joint Conferences on Artificial Intelligence, pages 626\u2013631, August 1997. 67"},{"key":"5_CR33","unstructured":"Moshe Tennenholtz. Some tractable combinatorial auctions. In the national conference on artificial intelligence (AAAI-2000), 2000. 65"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"W. Vickrey. Counterspeculation, auctions and competitive sealed tenders. Journal of Finance, pages 8\u201337, 1961. 63","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"},{"key":"5_CR35","unstructured":"Nir Vulkan and Ken Binmore. Applying game theory to automated negotiation. To appear. 67"},{"key":"5_CR36","unstructured":"W. E. Walsh and M. P. Wellman. A market protocol for decentralized task allocation: Extended version. In The Proceedings of the Third International Conference on Multi-Agent Systems (ICMAS-98), 1998. 67"},{"key":"5_CR37","unstructured":"W. E. Walsh, M. P. Wellman, P. R. Wurman, and J. K. MacK ie-Mason. Auction protocols for decentralized scheduling. In Proceedings of The Eighteenth International Conference on Distributed Computing Systems (ICDCS-98), Amsterdam, The Netherlands, 1998. 67"},{"key":"5_CR38","unstructured":"Gilad Zlotin. Mechanisms for Automated Negotiation among Autonomous Agents. PhD thesis, Hebrew University of Jerusalem, Departement of Computer Science, 1994. 67"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2000: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44411-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T04:23:03Z","timestamp":1556511783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44411-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540413486","9783540444114"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/3-540-44411-4_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}