{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,21]],"date-time":"2024-04-21T04:39:24Z","timestamp":1713674364772},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,5,13]],"date-time":"2014-05-13T00:00:00Z","timestamp":1399939200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10878-014-9754-9","type":"journal-article","created":{"date-parts":[[2014,5,12]],"date-time":"2014-05-12T11:09:43Z","timestamp":1399892983000},"page":"335-346","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Prompt mechanism for online auctions with multi-unit demands"],"prefix":"10.1007","volume":"30","author":[{"given":"Xiangzhong","family":"Xiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,13]]},"reference":[{"key":"9754_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal G, Goel G, Karande C, Mehta A (2011) Online vertex-weighted bipartite matching and single-bid budgeted allocations. In Proceedings of the twenty-second annual ACM-SIAM symposium on discrete algorithms, SIAM 1253\u20131264","DOI":"10.1137\/1.9781611973082.95"},{"key":"9754_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal G, Hartline J (2006) Knapsack auctions. In: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, ACM, 1083\u20131092","DOI":"10.1145\/1109557.1109677"},{"key":"9754_CR3","doi-asserted-by":"crossref","unstructured":"Archer A, Tardos \u00c9 (2001) Truthful mechanisms for one-parameter agents. In Foundations of Computer Science, Proceedings. 42nd IEEE Symposium on, IEEE, 482\u2013491","DOI":"10.1109\/SFCS.2001.959924"},{"key":"9754_CR4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-642-24829-0_4","volume":"6982","author":"Y Azar","year":"2011","unstructured":"Azar Y, Khaitsin E (2011) Prompt mechanism for ad placement over time. Algorithmic Game Theory 6982:19\u201330","journal-title":"Algorithmic Game Theory"},{"key":"9754_CR5","first-page":"187","volume":"2996","author":"Y Bartal","year":"2004","unstructured":"Bartal Y, Chin F, Chrobak M, Fung S, Jawor W, Lavi R, Sgall J, Tich\u1ef3 T (2004) Online competitive algorithms for maximizing weighted throughput of unit jobs. STACS 2996:187\u2013198","journal-title":"STACS"},{"key":"9754_CR6","doi-asserted-by":"crossref","unstructured":"Borgs C, Chayes J, Etesami O, Immorlica N, Jain K, Mahdian M (2007) Dynamics of bid optimization in online advertisement auctions. In Proceedings of the 16th international conference on World Wide Web, ACM, 531\u2013540","DOI":"10.1145\/1242572.1242644"},{"issue":"3","key":"9754_CR7","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/s10878-010-9297-7","volume":"23","author":"T-M Bu","year":"2012","unstructured":"Bu T-M, Deng X, Qi Q (2012) Multi-bidding strategy in sponsored search auctions. J Comb Optim 23(3):356\u2013372","journal-title":"J Comb Optim"},{"key":"9754_CR8","first-page":"210","volume":"3106","author":"W Chan","year":"2004","unstructured":"Chan W, Lam T, Ting H, Wong P (2004) New results on on-demand broadcasting with deadline via job scheduling with cancellation. Comput Comb 3106:210\u2013218","journal-title":"Comput Comb"},{"issue":"3","key":"9754_CR9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00453-003-1025-6","volume":"37","author":"F Chin","year":"2003","unstructured":"Chin F, Fung S (2003) Online scheduling with partial job values: does timesharing or randomization help? Algorithmica 37(3):149\u2013164","journal-title":"Algorithmica"},{"key":"9754_CR10","first-page":"204","volume":"3221","author":"M Chrobak","year":"2004","unstructured":"Chrobak M, Jawor W, Sgall J, Tich\u1ef3 T (2004) Improved online algorithms for buffer management in qos switches. Algorithms-ESA 3221:204\u2013215","journal-title":"Algorithms-ESA"},{"key":"9754_CR11","doi-asserted-by":"crossref","unstructured":"Cole R, Dobzinski S, Fleischer L (2008) Prompt mechanisms for online auctions. Algorithmic Game Theory 4997:170\u2013181","DOI":"10.1007\/978-3-540-79309-0_16"},{"issue":"2","key":"9754_CR12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10878-008-9200-y","volume":"20","author":"G D\u00f3sa","year":"2010","unstructured":"D\u00f3sa G, Epstein L (2010) Online scheduling with a buffer on related machines. J comb optim 20(2):161\u2013179","journal-title":"J comb optim"},{"issue":"1","key":"9754_CR13","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1257\/aer.97.1.242","volume":"97","author":"B Edelman","year":"2007","unstructured":"Edelman B, Ostrovsky M, Schwarz M (2007) Internet advertising and the generalized second-price auction: selling billions of dollars worth of keywords. Am Econ Rev 97(1):242\u2013259","journal-title":"Am Econ Rev"},{"key":"9754_CR14","unstructured":"Englert M, Westermann M (2007) Considering suppressed packets improves buffer management in qos switches. In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, 209\u2013218"},{"key":"9754_CR15","unstructured":"Li R, Yang L, He X, Chen Q, Cheng X (2011) Semi-online scheduling for jobs with release times. J Comb Optim, 1\u201317"},{"key":"9754_CR16","doi-asserted-by":"crossref","unstructured":"Nisan N, Bayer J, Chandra D, Franji T, Gardner R, Matias Y, Rhodes N, Seltzer M, Tom D, Varian H et al (2009) Google\u2019s auction for tv ads. Autom, Lang Program, 309\u2013327","DOI":"10.1007\/978-3-642-02930-1_26"},{"key":"9754_CR17","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/11758471_18","volume":"3998","author":"H Ting","year":"2006","unstructured":"Ting H (2006) A near optimal scheduler for on-demand data broadcasts. Algorithms Complex 3998:163\u2013174","journal-title":"Algorithms Complex"},{"key":"9754_CR18","doi-asserted-by":"crossref","unstructured":"Ting H, Xiang X (2012) Equilibria of gsp for range auction. In: Gudmundsson J, Mestre J, Viglas A (eds) Computing and combinatorics. Springer, New York, pp 580\u2013591","DOI":"10.1007\/978-3-642-32241-9_49"},{"issue":"1","key":"9754_CR19","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J Financ 16(1):8\u201337","journal-title":"J Financ"},{"key":"9754_CR20","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1007\/978-3-540-92185-1_63","volume":"5385","author":"Y Zhou","year":"2008","unstructured":"Zhou Y, Chakrabarty D, Lukose R (2008) Budget constrained bidding in keyword auctions and online knapsack problems. Internet Netw Econ 5385:566\u2013576","journal-title":"Internet Netw Econ"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9754-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9754-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9754-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T07:18:10Z","timestamp":1565421490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9754-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,13]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["9754"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9754-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,13]]}}}