{"id":"https://openalex.org/W2119875938","doi":"https://doi.org/10.1287/moor.2014.0684","title":"From Cost Sharing Mechanisms to Online Selection Problems","display_name":"From Cost Sharing Mechanisms to Online Selection Problems","publication_year":2014,"publication_date":"2014-12-08","ids":{"openalex":"https://openalex.org/W2119875938","doi":"https://doi.org/10.1287/moor.2014.0684","mag":"2119875938"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1287/moor.2014.0684","pdf_url":null,"source":{"id":"https://openalex.org/S55826652","display_name":"Mathematics of Operations Research","issn_l":"0364-765X","issn":["0364-765X","1526-5471"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dspace.mit.edu/bitstream/1721.1/98896/1/Levi_From%20cost.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005292316","display_name":"Adam N. Elmachtoub","orcid":"https://orcid.org/0000-0003-0729-4999"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"funder","lineage":["https://openalex.org/I78577930"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"funder","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Adam N. Elmachtoub","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, Columbia University, New York, 10027","Massachusetts Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, Columbia University, New York, 10027","institution_ids":["https://openalex.org/I78577930"]},{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032712683","display_name":"Retsef Levi","orcid":"https://orcid.org/0000-0002-1994-4875"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"funder","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Retsef Levi","raw_affiliation_strings":["Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139"],"affiliations":[{"raw_affiliation_string":"Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139","institution_ids":["https://openalex.org/I63966007"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.89,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":15,"citation_normalized_percentile":{"value":0.878693,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":89},"biblio":{"volume":"40","issue":"3","first_page":"542","last_page":"557"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9999,"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.9999,"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.9989,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9979,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7744273},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive Analysis","score":0.6502215},{"id":"https://openalex.org/keywords/online-and-offline","display_name":"Online and offline","score":0.43906516}],"concepts":[{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7744273},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.69155675},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6502215},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6354776},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.58587813},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4908877},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.46084476},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.44785622},{"id":"https://openalex.org/C2780102126","wikidata":"https://www.wikidata.org/wiki/Q10928179","display_name":"Online and offline","level":2,"score":0.43906516},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.362311},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20568764},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2035648},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14971495},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.0889698},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1287/moor.2014.0684","pdf_url":null,"source":{"id":"https://openalex.org/S55826652","display_name":"Mathematics of Operations Research","issn_l":"0364-765X","issn":["0364-765X","1526-5471"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/98896","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/98896/1/Levi_From%20cost.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":["Massachusetts Institute of Technology"],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/98896","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/98896/1/Levi_From%20cost.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":["Massachusetts Institute of Technology"],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":52,"referenced_works":["https://openalex.org/W1494325299","https://openalex.org/W1497029029","https://openalex.org/W1517384480","https://openalex.org/W1574583774","https://openalex.org/W158123262","https://openalex.org/W1759768216","https://openalex.org/W1986056047","https://openalex.org/W1990199392","https://openalex.org/W1991055327","https://openalex.org/W1999971061","https://openalex.org/W2001139415","https://openalex.org/W2003719999","https://openalex.org/W2019137296","https://openalex.org/W2023146810","https://openalex.org/W2029437526","https://openalex.org/W2030947259","https://openalex.org/W2037092605","https://openalex.org/W2038644905","https://openalex.org/W2039864651","https://openalex.org/W2044119054","https://openalex.org/W2046731583","https://openalex.org/W2054534588","https://openalex.org/W2071057992","https://openalex.org/W2076746184","https://openalex.org/W2086709935","https://openalex.org/W2089450981","https://openalex.org/W2102563009","https://openalex.org/W2107390991","https://openalex.org/W2107857629","https://openalex.org/W2107869104","https://openalex.org/W2114493937","https://openalex.org/W2114997377","https://openalex.org/W2115304243","https://openalex.org/W2115490387","https://openalex.org/W2124805016","https://openalex.org/W2129241249","https://openalex.org/W2132027865","https://openalex.org/W2137609516","https://openalex.org/W2150424787","https://openalex.org/W2151242668","https://openalex.org/W2163150343","https://openalex.org/W2172955861","https://openalex.org/W2177090493","https://openalex.org/W2178864388","https://openalex.org/W2614282775","https://openalex.org/W3122384578","https://openalex.org/W3123370463","https://openalex.org/W3123380468","https://openalex.org/W3125460146","https://openalex.org/W3148765228","https://openalex.org/W4256185527","https://openalex.org/W93178413"],"related_works":["https://openalex.org/W4362656112","https://openalex.org/W4300452271","https://openalex.org/W4200125285","https://openalex.org/W3175783641","https://openalex.org/W3097134967","https://openalex.org/W3094338351","https://openalex.org/W3042122676","https://openalex.org/W2620689363","https://openalex.org/W2294012348","https://openalex.org/W1863816925"],"abstract_inverted_index":{"We":[0,154],"consider":[1],"a":[2,32,37,110,137],"general":[3,111,158],"class":[4,119],"of":[5,88,120],"online":[6,10,52,86,115,140,169,175],"optimization":[7,93],"problems,":[8,12],"called":[9],"selection":[11,81,121],"where":[13],"customers":[14,44,56,71],"arrive":[15],"sequentially,":[16],"and":[17,159,168],"one":[18],"has":[19],"to":[20,25,62,85,113,151,173],"decide":[21],"upon":[22],"arrival":[23],"whether":[24],"accept":[26],"or":[27,53],"reject":[28],"each":[29],"customer.":[30],"If":[31],"customer":[33],"is":[34,40,61],"rejected,":[35],"then":[36],"rejection":[38,74],"cost":[39,130,165],"incurred.":[41],"The":[42,59],"accepted":[43,70],"are":[45,83,149],"served":[46],"with":[47,133],"minimum":[48],"possible":[49],"cost,":[50],"either":[51],"after":[54],"all":[55],"have":[57,96],"arrived.":[58],"goal":[60],"minimize":[63],"the":[64,69,73,77,101,125,143,146,157,180],"total":[65],"production":[66],"costs":[67,75],"for":[68,76,117,142,177],"plus":[72],"rejected":[78],"customers.":[79],"These":[80],"problems":[82,94,178],"related":[84],"variants":[87],"offline":[89],"prize":[90],"collecting":[91],"combinatorial":[92],"that":[95,156],"been":[97],"widely":[98],"studied":[99,182],"in":[100,183],"computer":[102],"science":[103],"literature.":[104],"In":[105,123],"this":[106,118,184],"paper,":[107],"we":[108,162],"provide":[109],"framework":[112,127],"develop":[114],"algorithms":[116,170,176],"problems.":[122],"essence,":[124],"algorithmic":[126],"leverages":[128],"any":[129],"sharing":[131,166],"mechanism":[132],"certain":[134],"properties":[135],"into":[136],"poly-logarithmic":[138],"competitive":[139,147],"algorithm":[141],"respective":[144],"problem;":[145],"ratios":[148],"shown":[150],"be":[152],"near-optimal.":[153],"believe":[155],"transparent":[160],"connection":[161],"establish":[163],"between":[164],"mechanisms":[167],"could":[171],"lead":[172],"additional":[174],"beyond":[179],"ones":[181],"paper.":[185]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2119875938","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2014,"cited_by_count":1}],"updated_date":"2025-03-16T13:53:15.127250","created_date":"2016-06-24"}