{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:29:01Z","timestamp":1725564541536},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540231707"},{"type":"electronic","value":"9783540301042"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-30104-2_20","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T03:34:35Z","timestamp":1283830475000},"page":"271-285","source":"Crossref","is-referenced-by-count":2,"title":["Auction Equilibrium Strategies for Task Allocation in Uncertain Environments"],"prefix":"10.1007","author":[{"given":"David","family":"Sarne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meirav","family":"Hadad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarit","family":"Kraus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Altman, E., Hassin, R.: Non-threshold equilibrium for customers joining an m\/g\/1 queue. In: Proceedings of 10th International Symposium on Dynamic Game and Applications, Saint-Petersburg, Russia (July 2002)"},{"key":"20_CR2","unstructured":"Boutilier, C., Goldszmidt, M., Sabata, B.: Sequential auctions for the allocation of resources with complementarities. In: IJCAI 1999, pp. 527\u2013523 (1999)"},{"key":"20_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-45012-2_10","volume-title":"Cooperative Information Agents IV - The Future of Information Agents in Cyberspace","author":"F. Brandt","year":"2000","unstructured":"Brandt, F., Brauer, W., Weiss, G.: Task assignment in multiagent systems based on vickrey-type auctioning and leveled commitment contracting. In: Klusch, M., Kerschberg, L. (eds.) CIA 2000. LNCS (LNAI), vol.\u00a01860, pp. 95\u2013106. Springer, Heidelberg (2000)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Byde, A., Preist, C., Jennings, N.: Decision procedures for multiple auctions. In: AAMAS 2002 (2002)","DOI":"10.1145\/544862.544888"},{"key":"20_CR5","unstructured":"Dias, B., Stentz, A.: Traderbots: A market-based approach for resource, role, and task allocation in multirobot coordination, Technical Report CMU-RI -TR- 03-19, Robotics Institute, CMU, PA (2003)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"McMillan, J., Rothschild, M.: Search. In: Aumann, R.J., Hart, A.S. (eds.) Handbook of Game Theory with Economic Applications, pp. 905\u2013927 (1994)","DOI":"10.1016\/S1574-0005(05)80059-1"},{"key":"20_CR7","first-page":"328","volume-title":"ICMAS 1995","author":"T. Sandholm","year":"1995","unstructured":"Sandholm, T., Lesser, V.: Issues in automated negotiation and electronic commerce: Extending the contract net framework. In: ICMAS 1995, pp. 328\u2013335. MIT Press, Cambridge (1995)"},{"issue":"3-4","key":"20_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1142\/S0218843002000613","volume":"11","author":"O. Shehory","year":"2002","unstructured":"Shehory, O.: Optimal bidding in multiple concurrent auctions. International Journal of Cooperative Information Systems\u00a011(3-4), 315\u2013327 (2002)","journal-title":"International Journal of Cooperative Information Systems"},{"issue":"12","key":"20_CR9","doi-asserted-by":"publisher","first-page":"1104","DOI":"10.1109\/TC.1980.1675516","volume":"29","author":"R.G. Smith","year":"1980","unstructured":"Smith, R.G.: The contract net protocol: High-level communication and control in a distributed problem solver. IEEE Transactions on Computers\u00a029(12), 1104\u20131113 (1980)","journal-title":"IEEE Transactions on Computers"},{"key":"20_CR10","unstructured":"Smith, T., Sandholm, T., Simmons, R.: Constructing and clearing combinatorial exchanges using preference elicitation, 2002. In: AAAI workshop on Preferences in AI and CP: Symbolic Approaches (2002)"},{"key":"20_CR11","unstructured":"Walsh, W., Wellman, M.: Efficiency and equilibrium in task allocation economies with hierarchical dependencies. In: IJCAI 1999, pp. 520\u2013526 (1999)"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1006\/game.2000.0822","volume":"35","author":"M. Wellman","year":"2001","unstructured":"Wellman, M., Walsh, W.: Auction protocols for decentralized scheduling. Games and Economic Behavior\u00a035, 271\u2013303 (2001)","journal-title":"Games and Economic Behavior"}],"container-title":["Lecture Notes in Computer Science","Cooperative Information Agents VIII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30104-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:47:48Z","timestamp":1558302468000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30104-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540231707","9783540301042"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30104-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}