{"id":"https://openalex.org/W2977691286","doi":"https://doi.org/10.1007/s00224-022-10081-0","title":"Impartial Selection with Additive Approximation Guarantees","display_name":"Impartial Selection with Additive Approximation Guarantees","publication_year":2022,"publication_date":"2022-04-30","ids":{"openalex":"https://openalex.org/W2977691286","doi":"https://doi.org/10.1007/s00224-022-10081-0","mag":"2977691286"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-022-10081-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-022-10081-0","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://pure.au.dk/portal/en/publications/3fc71a2d-cffe-44f7-84aa-c2fe0599638e","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046035189","display_name":"Ioannis Caragiannis","orcid":"https://orcid.org/0000-0002-4918-7131"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Ioannis Caragiannis","raw_affiliation_strings":["Department of Computer Science, Aarhus University, \u00c5bogade 34, 8200, Aarhus N, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aarhus University, \u00c5bogade 34, 8200, Aarhus N, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054751334","display_name":"George Christodoulou","orcid":"https://orcid.org/0000-0002-9623-7461"},"institutions":[{"id":"https://openalex.org/I21370196","display_name":"Aristotle University of Thessaloniki","ror":"https://ror.org/02j61yw88","country_code":"GR","type":"education","lineage":["https://openalex.org/I21370196"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"George Christodoulou","raw_affiliation_strings":["School of Informatics, Aristotle University of Thessaloniki, Ethnikis Antistasis 16, 2nd Floor, Office 24, 55133, Kalamaria, Greece"],"affiliations":[{"raw_affiliation_string":"School of Informatics, Aristotle University of Thessaloniki, Ethnikis Antistasis 16, 2nd Floor, Office 24, 55133, Kalamaria, Greece","institution_ids":["https://openalex.org/I21370196"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053781572","display_name":"Nicos Protopapas","orcid":"https://orcid.org/0000-0002-6130-3641"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nicos Protopapas","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, Ashton Building, Ashton Street, Liverpool, L69 3BX, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, Ashton Building, Ashton Street, Liverpool, L69 3BX, UK","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5046035189"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":1.184,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.79428295,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"66","issue":"3","first_page":"721","last_page":"742"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9842000007629395,"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"}},"topics":[{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9842000007629395,"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/T12288","display_name":"Optimization and Search Problems","score":0.9811000227928162,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9768000245094299,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.7457001209259033},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43766483664512634},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.391487717628479},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36130911111831665},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1865425705909729}],"concepts":[{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.7457001209259033},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43766483664512634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.391487717628479},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36130911111831665},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1865425705909729}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00224-022-10081-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-022-10081-0","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/3fc71a2d-cffe-44f7-84aa-c2fe0599638e","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/3fc71a2d-cffe-44f7-84aa-c2fe0599638e","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Caragiannis, I, Christodoulou, G & Protopapas, N 2022, 'Impartial Selection with Additive Approximation Guarantees', Theory of Computing Systems, vol. 66, no. 3, pp. 721-742. https://doi.org/10.1007/s00224-022-10081-0","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1910.00135","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1910.00135","pdf_url":"https://arxiv.org/pdf/1910.00135","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/3fc71a2d-cffe-44f7-84aa-c2fe0599638e","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/3fc71a2d-cffe-44f7-84aa-c2fe0599638e","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Caragiannis, I, Christodoulou, G & Protopapas, N 2022, 'Impartial Selection with Additive Approximation Guarantees', Theory of Computing Systems, vol. 66, no. 3, pp. 721-742. https://doi.org/10.1007/s00224-022-10081-0","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W181649221","https://openalex.org/W1129480147","https://openalex.org/W1473750384","https://openalex.org/W1558752712","https://openalex.org/W1921880471","https://openalex.org/W2044376135","https://openalex.org/W2055395921","https://openalex.org/W2091152488","https://openalex.org/W2093375346","https://openalex.org/W2103012681","https://openalex.org/W2484891765","https://openalex.org/W2564532471","https://openalex.org/W2778870909","https://openalex.org/W2788017180","https://openalex.org/W2963668529","https://openalex.org/W2964183251","https://openalex.org/W2972339248","https://openalex.org/W4233413206","https://openalex.org/W4251986490","https://openalex.org/W4296288933"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027"],"abstract_inverted_index":{"Impartial":[0],"selection":[1,70,133],"has":[2,67],"recently":[3],"received":[4],"much":[5],"attention":[6],"within":[7],"the":[8,22,35,94,99,102,108,113,121,149,155,160,181],"multi-agent":[9],"systems":[10],"community.":[11],"The":[12],"task":[13],"is,":[14],"given":[15],"a":[16,25,32,178,214],"directed":[17],"graph":[18],"representing":[19],"nominations":[20,106,111],"to":[21,30,191],"members":[23],"of":[24,38,62,96,105,110,112,120,123,140,184,195,200,218],"community":[26,161],"by":[27,89,168],"other":[28],"members,":[29],"select":[31],"member":[33,57],"with":[34,72,85],"highest":[36,103],"number":[37,104,109],"nominations.":[39],"This":[40],"seemingly":[41],"trivial":[42],"goal":[43],"becomes":[44],"challenging":[45],"when":[46],"there":[47],"is":[48],"an":[49,117],"additional":[50],"impartiality":[51],"constraint,":[52],"requiring":[53],"that":[54,80],"no":[55],"single":[56],"can":[58],"influence":[59],"her":[60],"chance":[61],"being":[63],"selected.":[64],"Recent":[65],"progress":[66],"identified":[68],"impartial":[69,124,132,223],"rules":[71],"optimal":[73],"approximation":[74,138],"ratios.":[75],"Moreover,":[76],"it":[77],"was":[78],"noted":[79],"worst-case":[81],"instances":[82],"are":[83],"graphs":[84],"few":[86],"vertices.":[87],"Motivated":[88],"this":[90],"fact,":[91],"we":[92,176,212],"propose":[93],"study":[95],"additive":[97,137],"approximation,":[98],"difference":[100],"between":[101],"and":[107,144,199,207],"selected":[114],"member,":[115],"as":[116],"alternative":[118],"measure":[119],"quality":[122],"selection.":[125],"Our":[126],"positive":[127,166],"results":[128,167,171],"include":[129],"two":[130,150],"randomized":[131,208],"mechanisms":[134],"which":[135,188],"have":[136],"guarantees":[139],"${\\varTheta":[141,145],"}(\\sqrt":[142,202],"{n})$":[143,203],"}(n^{2/3}\\ln":[146],"^{1/3}n)$":[147],"for":[148,172,180,204,220],"most":[151],"studied":[152],"models":[153],"in":[154],"literature,":[156],"where":[157],"n":[158,196],"denotes":[159],"size.":[162],"We":[163],"complement":[164],"our":[165],"providing":[169],"negative":[170],"various":[173],"cases.":[174],"First,":[175],"provide":[177],"characterization":[179],"interesting":[182],"class":[183],"strong":[185],"sample":[186],"mechanisms,":[187],"allows":[189],"us":[190],"obtain":[192],"lower":[193,216],"bounds":[194],"\u2212":[197],"2,":[198],"${\\varOmega":[201],"their":[205],"deterministic":[206,222],"variants":[209],"respectively.":[210],"Finally,":[211],"present":[213],"general":[215],"bound":[217],"3":[219],"all":[221],"mechanisms.":[224]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}
