{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T04:12:51Z","timestamp":1750824771922,"version":"3.41.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319666990"},{"type":"electronic","value":"9783319667003"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66700-3_3","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T12:38:47Z","timestamp":1503059927000},"page":"29-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Online Random Sampling for Budgeted Settings"],"prefix":"10.1007","author":[{"given":"Alon","family":"Eden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Feldman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adi","family":"Vardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,19]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Abrams, Z.: Revenue maximization when bidders have budgets. In: SODA, pp. 1074\u20131082. SIAM (2006)","DOI":"10.1145\/1109557.1109676"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Meyerson, A.: Reducing truth-telling online mechanisms to online optimization. In: STOC, pp. 503\u2013510. ACM (2003)","DOI":"10.1145\/780542.780616"},{"key":"3_CR3","unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: SODA, pp. 434\u2013443. SIAM (2007)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Immorlica, N., Lucier, Weinberg, S.M.: A simple and approximately optimal mechanism for an additive buyer. In: FOCS (2014)","DOI":"10.1109\/FOCS.2014.11"},{"key":"3_CR5","unstructured":"Bar-Yossef, Z., Hildrum, K., Wu, F.: Incentive-compatible online auctions for digital goods. In: SODA, pp. 964\u2013970. SIAM (2002)"},{"key":"3_CR6","unstructured":"Blum, A., Hartline, J.D.: Near-optimal online auctions. In: SODA, pp. 1156\u20131163. SIAM (2005)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Borgs, C., Chayes, J., Immorlica, N., Mahdian, M., Saberi, A.: Multi-unit auctions with budget-constrained bidders. In: EC, pp. 44\u201351. ACM (2005)","DOI":"10.1145\/1064009.1064014"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J.D., Malec, D.L., Sivan, B.: Multi-parameter mechanism design and sequential posted pricing. In: STOC. ACM (2010)","DOI":"10.1145\/1806689.1806733"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Chawla, S., Malec, D.L., Malekian, A.: Bayesian mechanism design for budget-constrained agents. In: EC, pp. 253\u2013262. ACM (2011)","DOI":"10.1145\/1993574.1993613"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.geb.2012.08.010","volume":"91","author":"S Chawla","year":"2015","unstructured":"Chawla, S., Malec, D.L., Sivan, B.: The power of randomness in Bayesian optimal mechanism design. Games Econ. Behav. 91, 297\u2013317 (2015)","journal-title":"Games Econ. Behav."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Ha, B.Q., Hartline, J.D.: Prior-free auctions for budgeted agents. In: EC, pp. 287\u2013304. ACM (2013)","DOI":"10.1145\/2482540.2482554"},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1016\/j.geb.2011.08.003","volume":"74","author":"S Dobzinski","year":"2012","unstructured":"Dobzinski, S., Lavi, R., Nisan, N.: Multi-unit auctions with budget limits. Games Econ. Behav. 74(2), 486\u2013503 (2012)","journal-title":"Games Econ. Behav."},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-662-43948-7_33","volume-title":"Automata, Languages, and Programming","author":"S Dobzinski","year":"2014","unstructured":"Dobzinski, S., Leme, R.P.: Efficiency guarantees in auctions with budgets. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 392\u2013404. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-43948-7_33"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fiat, A., Leonardi, S., Sankowski, P.: Revenue maximizing envy-free multi-unit auctions with budgets. In: EC, pp. 532\u2013549. ACM (2012)","DOI":"10.1145\/2229012.2229052"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Fiat, A., Leonardi, S., Saia, J., Sankowski, P.: Single valued combinatorial auctions with budgets. In: EC, pp. 223\u2013232. ACM (2011)","DOI":"10.1145\/1993574.1993609"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Friedman, E.J., Parkes, D.C.: Pricing WiFi at starbucks: issues in online mechanism design. In: EC, pp. 240\u2013241. ACM (2003)","DOI":"10.1145\/779928.779978"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Goel, G., Mirrokni, V., Leme, R.P.: Clinching auctions with online supply. In: SODA, pp. 605\u2013619. SIAM (2013)","DOI":"10.1137\/1.9781611973105.44"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.geb.2006.02.003","volume":"55","author":"AV Goldberg","year":"2006","unstructured":"Goldberg, A.V., Hartline, J.D., Karlin, A.R., Saks, M., Wright, A.: Competitive auctions. Games Econ. Behav. 55, 242\u2013269 (2006). Elsevier","journal-title":"Games Econ. Behav."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Parkes, D.C.: Adaptive limited-supply online auctions. In: EC, pp. 71\u201380. ACM (2004)","DOI":"10.1145\/988772.988784"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kleinberg, R.D., Mahdian, M., Parkes, D.C.: Online auctions with re-usable goods. In: EC, pp. 165\u2013174. ACM (2005)","DOI":"10.1145\/1064009.1064027"},{"key":"3_CR21","unstructured":"Kleinberg, R.: A multiple-choice secretary algorithm with applications to online auctions. In: SODA, pp. 630\u2013631. SIAM (2005)"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Lavi, R., Nisan, N.: Competitive analysis of incentive compatible on-line auctions. In: EC, pp. 233\u2013241. ACM (2000)","DOI":"10.1145\/352871.352897"},{"key":"3_CR23","unstructured":"Lavi, R., Nisan, N.: Online ascending auctions for gradually expiring items. In: SODA, pp. 1146\u20131155. SIAM (2005)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Lu, P., Xiao, T.: Improved efficiency guarantees in auctions with budgets. In: EC 2015, Portland, OR, USA, 15\u201319 June 2015, pp. 397\u2013413 (2015)","DOI":"10.1145\/2764468.2764500"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Parkes, D.C.: Online Mechanisms (2007)","DOI":"10.1017\/CBO9780511800481.018"},{"key":"3_CR26","unstructured":"Parkes, D.C., Singh, S.P.: An MDP-based approach to online mechanism design. In: NIPS (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66700-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T23:26:36Z","timestamp":1750807596000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66700-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319666990","9783319667003"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66700-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"L'Aquila","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.gssi.infn.it\/sagt2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}