{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T04:10:05Z","timestamp":1741320605173,"version":"3.38.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,7,14]],"date-time":"2011-07-14T00:00:00Z","timestamp":1310601600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Evolving Systems"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s12530-011-9035-0","type":"journal-article","created":{"date-parts":[[2011,7,13]],"date-time":"2011-07-13T14:31:05Z","timestamp":1310567465000},"page":"219-233","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive bidding in combinatorial auctions in dynamic markets"],"prefix":"10.1007","volume":"2","author":[{"given":"Xin","family":"Sui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ho-fung","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,7,14]]},"reference":[{"issue":"4","key":"9035_CR1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1057\/palgrave.rpm.5170119","volume":"3","author":"N An","year":"2005","unstructured":"An N, Elmaghraby W, Keskinocak P (2005) Bidding strategies and their impact on revenues in combinatorial auctions. J Revenue Pricing Manage 3(4):337\u2013357","journal-title":"J Revenue Pricing Manage"},{"issue":"2","key":"9035_CR2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/15427951.2004.10129086","volume":"1","author":"A Archer","year":"2004","unstructured":"Archer A, Papadimitriou C, Talwar K, Tardos E (2004) An approximate truthful mechanism for combinatorial auctions with single parameter agents. Internet Math 1(2):129\u2013150","journal-title":"Internet Math"},{"issue":"3","key":"9035_CR3","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1162\/105864097567174","volume":"6","author":"L Ausubel","year":"1997","unstructured":"Ausubel L, Cramton P, McAfee R, McMillan J (1997) Synergies in wireless telephony: evidence from the broadband PCS auctions. J Econ Manage Strategy 6(3):497\u2013527","journal-title":"J Econ Manage Strategy"},{"key":"9035_CR4","unstructured":"Ausubel LM, Cramton P, Milgrom P (2006) The clock-proxy auction: a practical combinatorial auction design. In: Cramton P, Shoham Y, Steinberg R (eds) Combinatorial auctions, chap 5, MIT Press, Cambridge, pp 115\u2013138"},{"key":"9035_CR5","doi-asserted-by":"crossref","unstructured":"Avasarala V, Polavarapu H, Mullen T (2006) An approximate algorithm for resource allocation using combinatorial auctions. In: Proceedings of the IEEE\/WIC\/ACM international conference on intelligent agent technology. IEEE Computer Society, Washington, DC, pp 571\u2013578","DOI":"10.1109\/IAT.2006.33"},{"key":"9035_CR6","doi-asserted-by":"crossref","unstructured":"Berhault M, Huang H, Keskinocak P, Koenig S, Elmaghraby W, Griffin P, Kleywegt A (2003) Robot exploration with combinatorial auctions. In: Proceedings of the international conference on intelligent robots and systems, vol 2. IEEE, Piscataway","DOI":"10.1109\/IROS.2003.1248932"},{"issue":"13\u201315","key":"9035_CR7","doi-asserted-by":"crossref","first-page":"1507","DOI":"10.1002\/cpe.690","volume":"14","author":"R Buyya","year":"2002","unstructured":"Buyya R, Abramson D, Giddy J, Stockinger H (2002) Economic models for resource management and scheduling in grid computing. Concurrency Comput Pract Exp 14(13\u201315):1507\u20131542","journal-title":"Concurrency Comput Pract Exp"},{"key":"9035_CR8","doi-asserted-by":"crossref","unstructured":"Chen M, Yang G, Liu X Gridmarket (2004) A practical, efficient market balancing resource for Grid and P2P computing. Lect Notes Comput Sci 3033:612\u2013619","DOI":"10.1007\/978-3-540-24680-0_99"},{"issue":"1","key":"9035_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1008654125853","volume":"12","author":"J Cheng","year":"1998","unstructured":"Cheng J, Wellman M (1998) The WALRAS algorithm: a convergent distributed implementation of general equilibrium outcomes. Comput Econ 12(1):1\u201324","journal-title":"Comput Econ"},{"key":"9035_CR10","doi-asserted-by":"crossref","unstructured":"Cramton P, Shoham Y, Steinberg R (2006) Combinatorial auctions. MIT Press, Cambridge","DOI":"10.7551\/mitpress\/9780262033428.001.0001"},{"issue":"3","key":"9035_CR38","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S Vries de","year":"2003","unstructured":"de Vries S, Vohra R (2003) Combinatorial auctions: a survey. Inform J Comput 15(3):284\u2013309","journal-title":"Inform J Comput"},{"key":"9035_CR11","unstructured":"Elmaghraby W, Keskinocak P (2003) Combinatorial auctions in procurement. Int Ser Oper Res Manage Sci 62(Part 3):245\u2013258"},{"key":"9035_CR12","doi-asserted-by":"crossref","unstructured":"Eymann T, Reinicke M, Ardaiz O, Artigas P, Freitag F, Navarro L (2003) Decentralized resource allocation in application layer networks. In: Proceedings of the 3rd IEEE\/ACM international symposium on cluster computing and the grid, pp 645\u2013650","DOI":"10.1109\/CCGRID.2003.1199427"},{"issue":"3","key":"9035_CR13","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1177\/109434200101500302","volume":"15","author":"I Foster","year":"2001","unstructured":"Foster I, Kesselman C, Tuecke S (2001) The anatomy of the grid: enabling scalable virtual organizations. Int J High Perform Comput Appl 15(3):200","journal-title":"Int J High Perform Comput Appl"},{"key":"9035_CR14","unstructured":"Fujishima Y, Leyton-Brown K, Shoham Y (1999) Taming the computational complexity of combinatorial auctions: optimal and approximate approaches. In: Proceedings of the sixteenth international joint conference on artificial intelligence, pp 548\u2013553"},{"key":"9035_CR15","unstructured":"Grosu D, Das A (2004) Auction-based resource allocation protocols in grids. In: Proceedings of the 16th IASTED international conference on parallel and distributed computing and systems, pp 20\u201327"},{"issue":"6","key":"9035_CR16","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1109\/TKDE.2003.1245277","volume":"15","author":"M He","year":"2003","unstructured":"He M, Leung HF, Jennings N (2003) A fuzzy-logic based bidding strategy for autonomous agents in continuous double auctions. IEEE Trans Knowl Data Eng 15(6):1345\u20131363","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"9035_CR17","unstructured":"Holland A, O\u2019Sullivan B (2007) Truthful risk-managed combinatorial auctions. In: Proceedings of the twentieth international joint conference on artificial intelligence, pp 1315\u20131320"},{"key":"9035_CR18","unstructured":"Hoos HH, Boutilier C (2000) Solving combinatorial auctions using stochastic local search. In: Proceedings of the seventeenth national conference on artificial intelligence, pp 22\u201329"},{"key":"9035_CR19","doi-asserted-by":"crossref","unstructured":"Kale L, Kumar S, Potnuru M, DeSouza J, Bandhakavi S (2004) Faucets: efficient resource allocation on the computational grid. In: Proceedings of the 2004 international conference on parallel processing, pp 396\u2013405","DOI":"10.1109\/ICPP.2004.1327948"},{"key":"9035_CR20","first-page":"366","volume":"1","author":"U Kant","year":"2005","unstructured":"Kant U, Grosu D (2005) Double auction protocols for resource allocation in grids. Proc Int Conf Inform Technol Coding Comput 1:366\u2013371","journal-title":"Proc Int Conf Inform Technol Coding Comput"},{"key":"9035_CR21","unstructured":"Krishna V (2002) Auction theory. Academic Press, New York"},{"key":"9035_CR22","unstructured":"Lavi R, Mu\u2019alem A, Nisan N (2003) Towards a characterization of truthful combinatorial auctions. In: Proceedings of the 44th annual IEEE symposium on foundations of computer science. IEEE Computer Society, Washington, DC"},{"key":"9035_CR23","doi-asserted-by":"crossref","unstructured":"Lehmann D, O\u2019callaghan LI, Shoham Y (1999) Truth revelation in rapid, approximately efficient combinatorial auctions. In: Proceedings of the ACM conference on electronic commerce, pp 96\u2013102","DOI":"10.1145\/336992.337016"},{"key":"9035_CR24","doi-asserted-by":"crossref","unstructured":"Ma H, Leung HF (2007) Adaptive agents for sequential english auctions with a fixed deadline. In: Proceedings of the 9th IEEE international conference on E-commerce technology and the 4th IEEE international conference on enterprise computing, E-commerce, and E-services, pp 29\u201338","DOI":"10.1109\/CEC-EEE.2007.17"},{"key":"9035_CR25","unstructured":"Ma H, Leung HF (2008) Bidding strategies in agent-based continuous double auctions. Birkh\u00e4user, Basel"},{"key":"9035_CR26","doi-asserted-by":"crossref","unstructured":"Nisan N (2000) Bidding and allocation in combinatorial auctions. In: Proceedings of the 2nd ACM conference on electronic commerce, EC \u201900. ACM, New York, pp 1\u201312","DOI":"10.1145\/352871.352872"},{"key":"9035_CR27","doi-asserted-by":"crossref","unstructured":"Nisan N, Ronen A (2000) Computationally feasible vcg mechanisms. In: Proceedings of the 2nd ACM conference on electronic commerce. ACM Press, New York, pp 242\u2013252","DOI":"10.1145\/352871.352898"},{"key":"9035_CR28","unstructured":"Parkes D, Ungar L (2000) Iterative combinatorial auctions: theory and practice. In: Proceedings of the national conference on artificial intelligence, pp 74\u201381"},{"issue":"2","key":"9035_CR29","doi-asserted-by":"crossref","first-page":"402","DOI":"10.2307\/3003463","volume":"13","author":"S Rassenti","year":"1982","unstructured":"Rassenti S, Smith V, Bulfin R (1982) A combinatorial auction mechanism for airport time slot allocation. Bell J Econ 13(2):402\u2013417","journal-title":"Bell J Econ"},{"key":"9035_CR30","doi-asserted-by":"crossref","unstructured":"Rastegari B, Condon A, Leyton-Brown K (2009) Stepwise randomized combinatorial auctions achieve revenue monotonicity. In: Proceedings of the nineteenth annual ACM\u2013SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, Philadelphia, pp 738\u2013747","DOI":"10.1137\/1.9781611973068.81"},{"issue":"8","key":"9035_CR31","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M Rothkopf","year":"1998","unstructured":"Rothkopf M, Pekec A, Harstad R (1998) Computationally manageable combinational auctions. Manage Sci 44(8):1131\u20131147","journal-title":"Manage Sci"},{"key":"9035_CR32","unstructured":"Sandholm T (1993) An implementation of the contract net protocol based on marginal cost calculations. In: Proceedings of the national conference on artificial intelligence, pp 256\u2013262"},{"issue":"1\u20132","key":"9035_CR33","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. Artif Intell Eng Des Anal Manuf 135(1\u20132):1\u201354","journal-title":"Artif Intell Eng Des Anal Manuf"},{"issue":"3","key":"9035_CR34","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1287\/mnsc.1040.0336","volume":"51","author":"T Sandholm","year":"2005","unstructured":"Sandholm T, Suri S, Gilpin A, Levine D (2005) CABOB: a fast optimal algorithm for winner determination in combinatorial auctions. Manage Sci 51(3):374\u2013390","journal-title":"Manage Sci"},{"key":"9035_CR35","unstructured":"Schwind M, Stockheim T, Gujo O (2006) Agents\u2019 bidding strategies in a combinatorial auction controlled grid environment. In: TADA\/AMEC, pp 149\u2013163"},{"issue":"1","key":"9035_CR36","first-page":"63","volume":"20","author":"R Smith","year":"1983","unstructured":"Smith R, Davis R (1983) Negotiation as a metaphor for distributed problem solving. Artif Intell Eng Des Anal Manuf 20(1):63\u2013109","journal-title":"Artif Intell Eng Des Anal Manuf"},{"key":"9035_CR37","doi-asserted-by":"crossref","unstructured":"Sureka A, Wurman PR (2005) Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions. In: Proceedings of the 2005 conference on genetic and evolutionary computation. ACM, New York, pp 2097\u20132103","DOI":"10.1145\/1068009.1068356"},{"key":"9035_CR39","doi-asserted-by":"crossref","unstructured":"Wilenius J, Andersson, A (2007) Discovering equilibrium strategies for a combinatorial first price auction. In: 9th IEEE international conference on E-commerce technology (CEC 2007)\/4th IEEE international conference on enterprise computing, E-commerce and E-services (EEE 2007), 23\u201326 July 2007, National Center of Sciences, Tokyo, Japan, IEEE Computer Society, pp 13\u201320","DOI":"10.1109\/CEC-EEE.2007.41"},{"key":"9035_CR40","unstructured":"Xiao L, Zhu Y, Ni L, Xu Z (2005) Gridis: an incentive-based grid scheduling. In: Proceedings of the 19th IEEE international parallel and distributed processing symposium, pp 65b\u201365b"},{"key":"9035_CR41","doi-asserted-by":"crossref","unstructured":"Yokoo M, Matsutani T, Iwasaki A (2006) False-name-proof combinatorial auction protocol: groves mechanism with submodular approximation. In: Proceedings of the 5th international joint conference on autonomous agents and multiagent systems, pp 1135\u20131142","DOI":"10.1145\/1160633.1160840"},{"key":"9035_CR42","doi-asserted-by":"crossref","unstructured":"Zurel E, Nisan N (2001) An efficient approximate allocation algorithm for combinatorial auctions. In: Proceedings of the 3rd ACM conference on electronic commerce. ACM, New York, pp 125\u2013136","DOI":"10.1145\/501158.501172"}],"container-title":["Evolving Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12530-011-9035-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12530-011-9035-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12530-011-9035-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T02:38:26Z","timestamp":1741315106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12530-011-9035-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,14]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["9035"],"URL":"https:\/\/doi.org\/10.1007\/s12530-011-9035-0","relation":{},"ISSN":["1868-6478","1868-6486"],"issn-type":[{"type":"print","value":"1868-6478"},{"type":"electronic","value":"1868-6486"}],"subject":[],"published":{"date-parts":[[2011,7,14]]}}}