{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T15:51:16Z","timestamp":1720713076951},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,4,19]],"date-time":"2009-04-19T00:00:00Z","timestamp":1240099200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1007\/s10458-009-9085-x","type":"journal-article","created":{"date-parts":[[2009,4,18]],"date-time":"2009-04-18T02:09:34Z","timestamp":1240020574000},"page":"342-368","source":"Crossref","is-referenced-by-count":7,"title":["A graphical formalism for mixed multi-unit combinatorial auctions"],"prefix":"10.1007","volume":"20","author":[{"given":"Andrea","family":"Giovannucci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jes\u00fas","family":"Cerquides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulle","family":"Endriss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan A.","family":"Rodr\u00edguez-Aguilar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,4,19]]},"reference":[{"key":"9085_CR1","unstructured":"Cramton, P., Shoham, Y., & Steinberg, R. (Eds.). (2006). Combinatorial auctions. MIT Press."},{"key":"9085_CR2","doi-asserted-by":"crossref","unstructured":"Walsh, W. E., Wellman, M. P., & Ygge, F. (2000). Combinatorial auctions for supply chain formation. In EC\u201900: Proceedings of the 2nd ACM conference on electronic commerce (pp. 260\u2013269). New York, NY: ACM.","DOI":"10.1145\/352871.352900"},{"key":"9085_CR3","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1613\/jair.1213","volume":"19","author":"W. Walsh","year":"2003","unstructured":"Walsh W., Wellman M. (2003) Decentralized supply chain formation: A market protocol and competitive equilibrium analysis. Journal of Artificial Intelligence Research 19: 513\u2013567","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9085_CR4","unstructured":"Cerquides, J., Endriss, U., Giovannucci, A., & Rodriguez-Aguilar, J. A. (2007). Bidding langua- ges and winner determination for mixed multi-unit combinatorial auctions. In Proceedings of the 20th international joint conferences on artificial intelligence (IJCAI) (pp. 1221\u20131226). Hyderabad, India."},{"issue":"1\u20133","key":"9085_CR5","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.jalgor.2008.02.008","volume":"63","author":"M. Vinyals","year":"2008","unstructured":"Vinyals M., Giovannucci A., Cerquides J., Meseguer P., Rodriguez-Aguilar J.A. (2008) A test suite for the evaluation of mixed multi-unit combinatorial auctions. Journal of Algorithms 63(1\u20133): 130\u2013150","journal-title":"Journal of Algorithms"},{"key":"9085_CR6","doi-asserted-by":"crossref","unstructured":"Giovannucci, A., Rodriguez-Aguilar, J. A., Cerquides, J., & Endriss, U. (2007). Winner determination for mixed multi-unit combinatorial auctions via petri nets. In AAMAS\u201907: Proceedings of the 6th international joint conference on autonomous agents and multiagent systems (pp. 710\u2013717). New York, NY: ACM.","DOI":"10.1145\/1329125.1329253"},{"key":"9085_CR7","doi-asserted-by":"crossref","unstructured":"Murata, T., (1989). Petri nets: Properties, analysis and applications. In Proceedings of the IEEE (Vol. 77, pp. 541\u2013580).","DOI":"10.1109\/5.24143"},{"key":"9085_CR8","doi-asserted-by":"crossref","unstructured":"Sandholm, T., Suri, S., Gilpin, A., & Levine, D. (2002). Winner determination in combinatorial auction generalizations. In AAMAS\u201902: Proceedings of the first international joint conference on autonomous agents and multiagent systems (pp. 69\u201376). Bologna: ACM Press.","DOI":"10.1145\/544741.544760"},{"key":"9085_CR9","unstructured":"Caplice, C., & Sheffi, Y. (2006). Combinatorial auctions for truckload transportation (Chap. 21). In Combinatorial auctions. MIT Press."},{"key":"9085_CR10","unstructured":"Cantillon, E., & Pesendorfer, M. (2006). Auctioning bus routes: The London experience (Chap. 22). In Combinatorial auctions. MIT Press."},{"key":"9085_CR11","unstructured":"Bichler, M., Davenport, A., Hohner, G., & Kalagnanam, J. (2006). Industrial procurement auctions (Chap. 23). In Combinatorial auctions. MIT Press."},{"key":"9085_CR12","unstructured":"Ball, M. O., Donohue, G. L., & Hoffman, K. (2006). Auctions for the safe, efficient, and equitable allocation of airspace system resources (Chap. 20). In Combinatorial auctions. MIT Press."},{"issue":"11","key":"9085_CR13","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1287\/mnsc.49.11.1485.20585","volume":"49","author":"A. Pekec","year":"2003","unstructured":"Pekec A., Rothkopf M.H. (2003) Combinatorial auction design. Management Science 49(11): 1485\u20131503","journal-title":"Management Science"},{"key":"9085_CR14","unstructured":"Krishna, V. (2002). Auction theory. Academic Press."},{"key":"9085_CR15","unstructured":"Milgrom, P. (2004). Putting auction theory to work. Cambridge University Press."},{"key":"9085_CR16","unstructured":"Nisan, N. (2006). Bidding languages for combinatorial auctions (Chap. 9). In Combinatorial auctions. MIT Press."},{"issue":"8","key":"9085_CR17","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M.H. Rothkopf","year":"1998","unstructured":"Rothkopf M.H., Pekec A., Harstad R.M. (1998) Computationally manageable combinational auctions. Management Science 44(8): 1131\u20131147","journal-title":"Management Science"},{"key":"9085_CR18","unstructured":"Andersson, A., Tenhunen, M., & Ygge, F. (2000). Integer programming for combinatorial auction winner determination, In Fourth international conference on multiagent systems (ICMAS 2000) (pp. 39\u201346). Boston, MA: IEE Press."},{"issue":"1\u20132","key":"9085_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0004-3702(01)00159-X","volume":"135","author":"T. Sandholm","year":"2002","unstructured":"Sandholm T. (2002) Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence 135(1\u20132): 1\u201354","journal-title":"Artificial Intelligence"},{"key":"9085_CR20","unstructured":"Fujishima, Y., Leyton-Brown, K., & Shoham, Y. (1999). Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In Proceeding of the sixteenth international joint conference on artificial intelligence (IJCAI\u201999) (pp. 548\u2013553)."},{"key":"9085_CR21","unstructured":"Leyton-Brown, K., Shoham, Y., & Tennenholtz, M. (2000). An algorithm for multi-unit combinatorial auctions. In Proceedings of the American association for artificial intelligence conference (AAAI) (pp. 56\u201361)."},{"key":"9085_CR22","unstructured":"Lehmann, D., M\u00fcller, R., & Sandholm, T. (2006). The winner determination problem (Chap. 12). Combinatorial auctions. MIT Press."},{"key":"9085_CR23","unstructured":"M\u00fcller, R. (2006). Tractable cases of the winner determination problem (Chap. 13). Combinatorial auctions. MIT Press."},{"key":"9085_CR24","unstructured":"Sandholm, T. (2006). Optimal winner determination algorithms (Chap. 14). Combinatorial auctions. MIT Press."},{"key":"9085_CR25","unstructured":"Giovannucci, A. (2008). Computationally manageable combinatorial auctions for supply chain automation, Ph.D. thesis, Universitat Autonoma de Barcelona. Departamento de ciencias de la Computacion. http:\/\/specs.upf.edu\/files\/u20\/Monografia.pdf"},{"key":"9085_CR26","unstructured":"Petri, C. (1966). Kommunikation mit Automaten. Univ. Bonn, Institut f\u00fcr Instrumentelle Mathematik, Schriften des IIM Nr. 2, 1962, Technical report (English translation: RADC-TR-65-377, Griffiths Air Base), New York."},{"key":"9085_CR27","unstructured":"Lipton, R. (1976). The reachability problem requires exponential space. Technical Report 62, Yale University."},{"issue":"1","key":"9085_CR28","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1023\/B:OPTE.0000013633.35184.6d","volume":"5","author":"A. Tarek","year":"2004","unstructured":"Tarek A., Lopez-Benitez N. (2004) Optimal legal firing sequence of Petri nets using linear programming. Optimization and Engineering 5(1): 25\u201343","journal-title":"Optimization and Engineering"},{"key":"9085_CR29","doi-asserted-by":"crossref","unstructured":"Engel, Y., Wellman, M. P., & Lochner, K. M. (2006). Bid expressiveness and clearing algorithms in multiattribute double auctions. In EC\u201906: Proceedings of the 7th ACM conference on electronic commerce (pp. 110\u2013119). New York, NY: ACM Press.","DOI":"10.1145\/1134707.1134720"},{"key":"9085_CR30","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/A:1008743212620","volume":"16","author":"J. Esparza","year":"2004","unstructured":"Esparza J., Melzer S. (2004) Verification of safety properties using integer programming: Beyond the state equation. Formal Methods in System Design 16: 159\u2013189","journal-title":"Formal Methods in System Design"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-009-9085-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-009-9085-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-009-9085-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:28:25Z","timestamp":1559150905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-009-9085-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,19]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["9085"],"URL":"https:\/\/doi.org\/10.1007\/s10458-009-9085-x","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4,19]]}}}