{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T08:10:23Z","timestamp":1739088623866,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642013461"},{"type":"electronic","value":"9783642013478"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01347-8_60","type":"book-chapter","created":{"date-parts":[[2009,5,4]],"date-time":"2009-05-04T17:06:48Z","timestamp":1241456808000},"page":"728-736","source":"Crossref","is-referenced-by-count":2,"title":["A Reputation-Based Game for Tasks Allocation"],"prefix":"10.1007","author":[{"given":"Hamdi","family":"Yahyaoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"60_CR1","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, E.: Truthful Mechanisms for One-Parameter Agents. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), Washington, USA, pp. 482\u2013491 (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"key":"60_CR2","doi-asserted-by":"crossref","unstructured":"Carroll, T., Grosu, D.: Selfish Multi-User Task Scheduling. In: Proceedings of The Fifth International Symposium on Parallel and Distributed Computing, pp. 99\u2013106 (2006)","DOI":"10.1109\/ISPDC.2006.44"},{"issue":"1","key":"60_CR3","first-page":"3","volume":"30","author":"Y. Chevaleyre","year":"2006","unstructured":"Chevaleyre, Y., Dunne, P.E., Endriss, U., Lang, J., Lema\u00eetre, M., Maudet, N., Padget, J., Phelps, S., Rodr\u00edguez-Aguilar, J.A., Sousa, P.: Issues in Multiagent Resource Allocation. Informatica\u00a030(1), 3\u201331 (2006)","journal-title":"Informatica"},{"key":"60_CR4","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination Mechanisms. In: Automata, Languages and Programming: 31st International Colloquium, Turku, Finland, pp. 345\u2013357 (July 2004)","DOI":"10.1007\/978-3-540-27836-8_31"},{"key":"60_CR5","unstructured":"Conitzer, V., Sandholm, T.: Complexity of Mechanism Design. In: Proceedings of the Uncertainty in Artificial Intelligence Conference (UAI), Edmonton, Canada, pp. 103\u2013110 (2002)"},{"key":"60_CR6","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T.: Automated Mechanism Design for a Self-interested Designer. In: Proceedings of the 5th ACM conference on Electronic Commerce, New York, USA, pp. 132\u2013141 (2004)","DOI":"10.1145\/779928.779974"},{"key":"60_CR7","unstructured":"Dash, R., Ramchurn, S., Jennings, N.: Trust-Based Mechanism Design. In: Third International Joint Conference on Autonomous Agents and Multiagent Systems, New York, USA, pp. 748\u2013755 (2004)"},{"issue":"1","key":"60_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00446-005-0122-y","volume":"18","author":"J. Feigenbaum","year":"2005","unstructured":"Feigenbaum, J., Papadimitriou, C., Sami, R., Shenkar, S.: A BGP-based Mechanism for Lowest-Cost Routing. Distributed Computing\u00a018(1), 61\u201372 (2005)","journal-title":"Distributed Computing"},{"issue":"1","key":"60_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jcss.2001.1754","volume":"63","author":"J. Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Papadimitriou, C., Shenker, S.: Sharing the Cost of Multicast Transmissions. JCSS: Journal of Computer and System Sciences\u00a063(1), 21\u201341 (2001)","journal-title":"JCSS: Journal of Computer and System Sciences"},{"key":"60_CR10","first-page":"101","volume":"79","author":"J. Feigenbaum","year":"2003","unstructured":"Feigenbaum, J., Shenker, S.: Distributed Algorithmic Mechanism Design: Recent Results and Future Directions. Bulletin of the European Association for Theoretical Computer Science\u00a079, 101\u2013121 (2003)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"60_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"60_CR12","volume-title":"Microeconomic Theory","author":"A. Mas-Colell","year":"1995","unstructured":"Mas-Colell, A., Whinston, M., Green, J.R.: Microeconomic Theory. Oxford University Press, Oxford (1995)"},{"issue":"1","key":"60_CR13","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/844331.844335","volume":"3","author":"E. Maximilien","year":"2002","unstructured":"Maximilien, E., Singh, M.: Reputation and Endorsement for Web Services. SIGecom Exchanges\u00a03(1), 24\u201331 (2002)","journal-title":"SIGecom Exchanges"},{"key":"60_CR14","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Algorithms for Selfish Agents. In: Proceedings of the Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, pp. 1\u201315 (1999)","DOI":"10.1007\/3-540-49116-3_1"},{"key":"60_CR15","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic Mechanism Design. In: Proceedings of ACM Symposium on Theory of Computing, Atlanta, USA, pp. 129\u2013140 (1999)","DOI":"10.1145\/301250.301287"},{"key":"60_CR16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1613\/jair.2046","volume":"29","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Ronen, A.: Computationally Feasible VCG Mechanisms. Journal of Artificial Intelligence Research (JAIR)\u00a029, 19\u201347 (2007)","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"60_CR17","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubenstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)"},{"key":"60_CR18","unstructured":"Parkes, D.C.: Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency. PhD thesis, Department of Computer and Information Science, University of Pennsylvania (2001)"},{"key":"60_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-540-45193-8_2","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"T. Sandholm","year":"2003","unstructured":"Sandholm, T.: Automated Mechanism Design: A New Application Area for Search Algorithms. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 19\u201336. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Business Information Processing","Enterprise Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01347-8_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T07:49:07Z","timestamp":1739087347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01347-8_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642013461","9783642013478"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01347-8_60","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"type":"print","value":"1865-1348"},{"type":"electronic","value":"1865-1356"}],"subject":[],"published":{"date-parts":[[2009]]}}}