{"id":"https://openalex.org/W2757299763","doi":"https://doi.org/10.1145/1721837.1721851","title":"Dynamic pricing for impatient bidders","display_name":"Dynamic pricing for impatient bidders","publication_year":2010,"publication_date":"2010-03-01","ids":{"openalex":"https://openalex.org/W2757299763","doi":"https://doi.org/10.1145/1721837.1721851","mag":"2757299763"},"language":"en","primary_location":{"id":"doi:10.1145/1721837.1721851","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1721837.1721851","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["IBM TJ Watson Research Center, Yorktown Heights, NY"],"affiliations":[{"raw_affiliation_string":"IBM TJ Watson Research Center, Yorktown Heights, NY","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Ning Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ning Chen","raw_affiliation_strings":["University of Washington, Seattle, WA"],"affiliations":[{"raw_affiliation_string":"University of Washington, Seattle, WA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030269857","display_name":"Neva C. Durand","orcid":"https://orcid.org/0009-0006-5647-2623"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neva Cherniavsky","raw_affiliation_strings":["University of Washington, Seattle, WA"],"affiliations":[{"raw_affiliation_string":"University of Washington, Seattle, WA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Atri Rurda","orcid":null},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Atri Rurda","raw_affiliation_strings":["University at Buffalo, The State University of New York, Buffalo, NY"],"affiliations":[{"raw_affiliation_string":"University at Buffalo, The State University of New York, Buffalo, NY","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089964489","display_name":"Baruch Schieber","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Baruch Schieber","raw_affiliation_strings":["IBM TJ Watson Research Center, Yorktown Heights, NY"],"affiliations":[{"raw_affiliation_string":"IBM TJ Watson Research Center, Yorktown Heights, NY","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":null,"display_name":"Maxim Sviridenko","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maxim Sviridenko","raw_affiliation_strings":["IBM TJ Watson Research Center, Yorktown Heights, NY"],"affiliations":[{"raw_affiliation_string":"IBM TJ Watson Research Center, Yorktown Heights, NY","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I1341412227"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.41278475,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":"2","first_page":"1","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.984000027179718,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.984000027179718,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.0052999998442828655,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.003000000026077032,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.6502881050109863},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6081634759902954},{"id":"https://openalex.org/keywords/revenue","display_name":"Revenue","score":0.5776047110557556},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5177875757217407},{"id":"https://openalex.org/keywords/unit-interval","display_name":"Unit interval","score":0.5080969333648682},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4823036193847656},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4749836325645447},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47234833240509033},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4523424208164215},{"id":"https://openalex.org/keywords/unit","display_name":"Unit (ring theory)","score":0.4457564353942871},{"id":"https://openalex.org/keywords/microeconomics","display_name":"Microeconomics","score":0.3581925630569458},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.2574572265148163},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21695104241371155},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12352213263511658},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.09986788034439087}],"concepts":[{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6502881050109863},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6081634759902954},{"id":"https://openalex.org/C195487862","wikidata":"https://www.wikidata.org/wiki/Q850210","display_name":"Revenue","level":2,"score":0.5776047110557556},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5177875757217407},{"id":"https://openalex.org/C128394911","wikidata":"https://www.wikidata.org/wiki/Q1987578","display_name":"Unit interval","level":2,"score":0.5080969333648682},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4823036193847656},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4749836325645447},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47234833240509033},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4523424208164215},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.4457564353942871},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.3581925630569458},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.2574572265148163},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21695104241371155},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12352213263511658},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.09986788034439087},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121955636","wikidata":"https://www.wikidata.org/wiki/Q4116214","display_name":"Accounting","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C145420912","wikidata":"https://www.wikidata.org/wiki/Q853077","display_name":"Mathematics education","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":11,"locations":[{"id":"doi:10.1145/1721837.1721851","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1721837.1721851","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/2b6f93ea-3036-48cb-bf2d-1ccc5e73e1f5","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/2b6f93ea-3036-48cb-bf2d-1ccc5e73e1f5","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Chen, N, Cherniavsky, N, Rudra, A, Schieber, B & Sviridenko, M 2007, Dynamic pricing for impatient bidders. in Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'07, New Orleans LA, USA, January 7-9, 2007). Association for Computing Machinery, Inc., New York, pp. 726-735.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:publications/c9e6b16d-ad3f-41c7-aba5-bfe626ce59e0","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/c9e6b16d-ad3f-41c7-aba5-bfe626ce59e0","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Chen, N, Cherniavsky, N, Rudra, A, Schieber, B & Sviridenko, M 2010, 'Dynamic pricing for impatient bidders', ACM Transactions on Algorithms, vol. 6, no. 2, 35, pp. 35-1/21. https://doi.org/10.1145/1721837.1721851","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:693878","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=693878","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1549-6325","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.138.6567","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.138.6567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.buffalo.edu/~atri/papers/game-theory/bansaln.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.296.3363","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.3363","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.warwick.ac.uk/fac/sci/dcs/people/maxim_sviridenko/pricing-talg-final.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.387.7258","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.7258","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/nchernia/www/publications/pricing-old.pdf","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:693878","is_oa":false,"landing_page_url":"http://repository.tue.nl/693878","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1549-6325","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:694838","is_oa":false,"landing_page_url":"http://repository.tue.nl/694838","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/2b6f93ea-3036-48cb-bf2d-1ccc5e73e1f5","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/2b6f93ea-3036-48cb-bf2d-1ccc5e73e1f5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'07, New Orleans LA, USA, January 7-9, 2007), 726 - 735","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:tue:oai:pure.tue.nl:publications/c9e6b16d-ad3f-41c7-aba5-bfe626ce59e0","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/c9e6b16d-ad3f-41c7-aba5-bfe626ce59e0","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Algorithms, 6(2):35, 35 - 1/21. Association for Computing Machinery, Inc","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6157841646","display_name":null,"funder_award_id":"CCR-0105406","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2005311763","https://openalex.org/W2141086070","https://openalex.org/W2150582214","https://openalex.org/W4247157595","https://openalex.org/W6667827967"],"related_works":["https://openalex.org/W3136734724","https://openalex.org/W2268157958","https://openalex.org/W2996947519","https://openalex.org/W3207235646","https://openalex.org/W3181446052","https://openalex.org/W2123999179","https://openalex.org/W2125782487","https://openalex.org/W2096662206","https://openalex.org/W2733177951","https://openalex.org/W1515889648","https://openalex.org/W2419310366","https://openalex.org/W2738804617","https://openalex.org/W2951215058","https://openalex.org/W2609342756","https://openalex.org/W2599134886","https://openalex.org/W3047112648","https://openalex.org/W1987458275","https://openalex.org/W1965867855","https://openalex.org/W2593597305","https://openalex.org/W2010377201"],"abstract_inverted_index":{"We":[0,201,239,270],"study":[1],"the":[2,46,54,60,67,73,79,87,95,102,106,122,125,137,140,147,155,161,164,168,173,183,187,190,215,225,232,242,250,253,275,290,302],"following":[3],"problem":[4],"related":[5],"to":[6,64,85,91],"pricing":[7],"over":[8,44,101,266],"time.":[9],"Assume":[10],"there":[11,31],"is":[12,20,32,38,62,84,146,237,264],"a":[13,24,41,51,57,76,203,309],"collection":[14],"of":[15,18,26,29,53,97,99,142,166,189,217,277,292],"bidders,":[16],"each":[17,180],"whom":[19],"interested":[21],"in":[22,170,245,305],"buying":[23,50],"copy":[25,52],"an":[27,33],"item":[28,123,251],"which":[30,45,246],"unlimited":[34],"supply.":[35],"Every":[36],"bidder":[37,47,61],"associated":[39],"with":[40,224,295],"time":[42,71,103,127,181,199,205],"interval":[43,132],"will":[48],"consider":[49,241],"item,":[55],"and":[56,208,211,219,234,284,286],"maximum":[58],"value":[59],"willing":[63],"pay":[65],"for":[66,78,281,301],"item.":[68,80],"On":[69],"every":[70],"unit,":[72],"seller":[74,162,184],"sets":[75],"price":[77,255],"The":[81,229,298],"seller's":[82],"goal":[83],"set":[86],"prices":[88],"so":[89],"as":[90,260,262],"maximize":[92],"revenue":[93],"from":[94],"sale":[96],"copies":[98],"items":[100],"period.":[104],"In":[105,154,172],"first":[107,126,148],"model":[108,244],"considered,":[109],"we":[110,158,176],"assume":[111,159,177],"that":[112,118,133,150,160,178,192,198],"all":[113,167],"bidders":[114,120,169,247],"are":[115,248],"impatient":[116],",":[117],"is,":[119],"buy":[121],"at":[124,179,197,252],"unit":[128,182],"within":[129],"their":[130,257,267],"bid":[131,258],"they":[134],"can":[135],"afford":[136],"price.":[138],"To":[139],"best":[141],"our":[143],"knowledge,":[144],"this":[145,152,282],"work":[149],"considers":[151],"model.":[153],"offline":[156,206,227],"setting,":[157],"knows":[163,186],"bids":[165,191],"advance.":[171],"online":[174,221,279],"setting":[175],"only":[185],"values":[188],"have":[193],"arrived":[194],"before":[195],"or":[196],"unit.":[200],"give":[202],"polynomial":[204],"algorithm":[207],"prove":[209,271],"upper":[210,233,285],"lower":[212,235,287,299],"bounds":[213,236,273,288,300],"on":[214,274,289],"competitiveness":[216,276,291],"deterministic":[218,278],"randomized":[220,293,303],"algorithms,":[222],"compared":[223],"optimal":[226],"solution.":[228],"gap":[230],"between":[231],"quadratic.":[238],"also":[240],"envy-free":[243],"sold":[249],"minimum":[254],"during":[256],"interval,":[259],"long":[261],"it":[263],"not":[265],"limit":[268],"value.":[269],"tight":[272],"algorithms":[280,294],"model,":[283],"quadratic":[296],"gap.":[297],"case":[304],"both":[306],"models":[307],"use":[308],"novel":[310],"general":[311],"technique.":[312]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}