{"id":"https://openalex.org/W2152946486","doi":"https://doi.org/10.1145/1980522.1980528","title":"Secretary problems and incentives via linear programming","display_name":"Secretary problems and incentives via linear programming","publication_year":2009,"publication_date":"2009-12-01","ids":{"openalex":"https://openalex.org/W2152946486","doi":"https://doi.org/10.1145/1980522.1980528","mag":"2152946486"},"language":"en","primary_location":{"id":"doi:10.1145/1980522.1980528","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1980522.1980528","pdf_url":null,"source":{"id":"https://openalex.org/S4210233839","display_name":"ACM SIGecom Exchanges","issn_l":"1551-9031","issn":["1551-9031"],"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 SIGecom Exchanges","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/A5002590915","display_name":"Niv Buchbinder","orcid":"https://orcid.org/0000-0002-7014-8954"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]},{"id":"https://openalex.org/I4400600948","display_name":"Microsoft Research New England (United States)","ror":"https://ror.org/010wkqn50","country_code":null,"type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Niv Buchbinder","raw_affiliation_strings":["Microsoft Research, New England"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, New England","institution_ids":["https://openalex.org/I4210164937","https://openalex.org/I4400600948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041706388","display_name":"Kamal Jain","orcid":"https://orcid.org/0000-0001-5153-0405"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Kamal Jain","raw_affiliation_strings":["Microsoft Research, Redmond"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020914506","display_name":"Mohit Singh","orcid":"https://orcid.org/0000-0002-0827-233X"},"institutions":[{"id":"https://openalex.org/I4400600948","display_name":"Microsoft Research New England (United States)","ror":"https://ror.org/010wkqn50","country_code":null,"type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]},{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mohit Singh","raw_affiliation_strings":["Microsoft Research, New England"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, New England","institution_ids":["https://openalex.org/I4210164937","https://openalex.org/I4400600948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002590915"],"corresponding_institution_ids":["https://openalex.org/I4210164937","https://openalex.org/I4400600948"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.20959847,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"8","issue":"2","first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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.9883000254631042,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9563999772071838,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.7864114046096802},{"id":"https://openalex.org/keywords/secretary-problem","display_name":"Secretary problem","score":0.6356549859046936},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5860542058944702},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5827908515930176},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5228229761123657},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.358337938785553},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.32935822010040283},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30430832505226135},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26964572072029114},{"id":"https://openalex.org/keywords/optimal-stopping","display_name":"Optimal stopping","score":0.13011637330055237},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.11737474799156189}],"concepts":[{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7864114046096802},{"id":"https://openalex.org/C183211740","wikidata":"https://www.wikidata.org/wiki/Q1372364","display_name":"Secretary problem","level":3,"score":0.6356549859046936},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5860542058944702},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5827908515930176},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5228229761123657},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.358337938785553},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.32935822010040283},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30430832505226135},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26964572072029114},{"id":"https://openalex.org/C99414536","wikidata":"https://www.wikidata.org/wiki/Q7098950","display_name":"Optimal stopping","level":2,"score":0.13011637330055237},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.11737474799156189},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1980522.1980528","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1980522.1980528","pdf_url":null,"source":{"id":"https://openalex.org/S4210233839","display_name":"ACM SIGecom Exchanges","issn_l":"1551-9031","issn":["1551-9031"],"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 SIGecom Exchanges","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.212.6536","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.6536","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sigecom.org/exchanges/volume_8/2/buchbinder.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1593308833","https://openalex.org/W1931679055","https://openalex.org/W2022013502","https://openalex.org/W2061418963","https://openalex.org/W2085480884","https://openalex.org/W2113654320","https://openalex.org/W2143149387","https://openalex.org/W2150582214","https://openalex.org/W2164792208","https://openalex.org/W2165436315","https://openalex.org/W2797720335"],"related_works":["https://openalex.org/W1931679055","https://openalex.org/W3116213140","https://openalex.org/W2335267977","https://openalex.org/W4213075821","https://openalex.org/W2287463498","https://openalex.org/W1754694893","https://openalex.org/W3110615909","https://openalex.org/W3131679123","https://openalex.org/W4287559241","https://openalex.org/W2152946486"],"abstract_inverted_index":{"In":[0],"the":[1,11,45,71,78],"classical":[2],"secretary":[3,46,72],"problem":[4,47,73],"an":[5],"employer":[6],"would":[7],"like":[8],"to":[9,77],"choose":[10],"best":[12],"candidate":[13],"among":[14],"n":[15],"competing":[16],"candidates":[17],"that":[18,33],"arrive":[19],"in":[20],"a":[21,28,37,65],"random":[22],"order.":[23],"Our":[24],"main":[25],"contribution":[26],"is":[27,54],"new":[29],"linear":[30,52,79],"programming":[31],"technique":[32],"we":[34,63],"introduce":[35],"as":[36],"tool":[38],"for":[39,44,70],"obtaining":[40],"and":[41,48,60,62,74],"analyzing":[42],"mechanisms":[43,69],"its":[49],"variants.":[50],"The":[51],"program":[53],"formulated":[55],"using":[56],"judiciously":[57],"chosen":[58],"variables":[59],"constraints":[61],"show":[64],"one-to-one":[66],"correspondence":[67],"between":[68],"feasible":[75],"solutions":[76],"program.":[80]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}