{"id":"https://openalex.org/W149515359","doi":"https://doi.org/10.1007/978-3-642-40164-0_18","title":"The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design","display_name":"The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W149515359","doi":"https://doi.org/10.1007/978-3-642-40164-0_18","mag":"149515359"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-40164-0_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40164-0_18","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5024158337","display_name":"Laurent Gourv\u00e8s","orcid":"https://orcid.org/0000-0002-5076-1583"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]},{"id":"https://openalex.org/I2746051580","display_name":"Universit\u00e9 Paris Sciences et Lettres","ror":"https://ror.org/013cjyk83","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Laurent Gourv\u00e8s","raw_affiliation_strings":["CNRS UMR 7243, France","PSL Universit\u00e9 Paris Dauphine, Paris Cedex 16, France"],"affiliations":[{"raw_affiliation_string":"CNRS UMR 7243, France","institution_ids":["https://openalex.org/I1294671590"]},{"raw_affiliation_string":"PSL Universit\u00e9 Paris Dauphine, Paris Cedex 16, France","institution_ids":["https://openalex.org/I56435720","https://openalex.org/I2746051580"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080998576","display_name":"J\u00e9r\u00f4me Monnot","orcid":"https://orcid.org/0000-0002-7452-6553"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]},{"id":"https://openalex.org/I2746051580","display_name":"Universit\u00e9 Paris Sciences et Lettres","ror":"https://ror.org/013cjyk83","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"J\u00e9r\u00f4me Monnot","raw_affiliation_strings":["CNRS UMR 7243, France","PSL Universit\u00e9 Paris Dauphine, Paris Cedex 16, France"],"affiliations":[{"raw_affiliation_string":"CNRS UMR 7243, France","institution_ids":["https://openalex.org/I1294671590"]},{"raw_affiliation_string":"PSL Universit\u00e9 Paris Dauphine, Paris Cedex 16, France","institution_ids":["https://openalex.org/I56435720","https://openalex.org/I2746051580"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091546742","display_name":"Aris Pagourtzis","orcid":"https://orcid.org/0000-0002-6220-3722"},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Aris T. Pagourtzis","raw_affiliation_strings":["School of Electrical and Computer Engineering, National Technical University of Athens (NTUA), Zographou, Greece"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, National Technical University of Athens (NTUA), Zographou, Greece","institution_ids":["https://openalex.org/I174458059"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5024158337"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I2746051580","https://openalex.org/I56435720"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.3312,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.79227626,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"171","last_page":"182"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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.9998000264167786,"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.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7359300851821899},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6547899842262268},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5810166001319885},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5693632960319519},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5572912693023682},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5528075098991394},{"id":"https://openalex.org/keywords/perspective","display_name":"Perspective (graphical)","score":0.5214873552322388},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45890137553215027},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.45647674798965454},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4560747742652893},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4114207625389099},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27713334560394287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21826133131980896},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12852239608764648}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7359300851821899},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6547899842262268},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5810166001319885},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5693632960319519},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5572912693023682},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5528075098991394},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.5214873552322388},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45890137553215027},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.45647674798965454},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4560747742652893},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4114207625389099},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27713334560394287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21826133131980896},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12852239608764648},{"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":4,"locations":[{"id":"doi:10.1007/978-3-642-40164-0_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40164-0_18","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.408.9435","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.408.9435","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lamsade.dauphine.fr/~monnot/index_fichiers/conf/fct13_lazy.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01429311v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01429311","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"19th International Symposium, FCT 2013, Aug 2013, Liverpool, United Kingdom. pp.171-182, ⟨10.1007/978-3-642-40164-0_18⟩","raw_type":"Conference papers"},{"id":"pmh:oai:basepub.dauphine.fr:123456789/16136","is_oa":false,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/16136","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5600000023841858,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W820461064","https://openalex.org/W1500270910","https://openalex.org/W1506292197","https://openalex.org/W1507039213","https://openalex.org/W1562033891","https://openalex.org/W1565331571","https://openalex.org/W1567235199","https://openalex.org/W1574082713","https://openalex.org/W1661438368","https://openalex.org/W1887192575","https://openalex.org/W1965153006","https://openalex.org/W1968033609","https://openalex.org/W2001915926","https://openalex.org/W2037096763","https://openalex.org/W2048451395","https://openalex.org/W2497423579","https://openalex.org/W3098987631","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W2891776881","https://openalex.org/W2244559970","https://openalex.org/W189876032","https://openalex.org/W2557467218","https://openalex.org/W2536297025","https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2367938014","https://openalex.org/W2771290394","https://openalex.org/W2918080139"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}