{"id":"https://openalex.org/W2469837900","doi":"https://doi.org/10.1145/3186990","title":"Faster Algorithms for Computing Plurality Points","display_name":"Faster Algorithms for Computing Plurality Points","publication_year":2018,"publication_date":"2018-06-16","ids":{"openalex":"https://openalex.org/W2469837900","doi":"https://doi.org/10.1145/3186990","mag":"2469837900"},"language":"en","primary_location":{"id":"doi:10.1145/3186990","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3186990","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":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/81280b4b-29bf-4db5-a433-d42e34d69a65","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028410825","display_name":"Mark de Berg","orcid":"https://orcid.org/0000-0001-5770-3784"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Mark De Berg","raw_affiliation_strings":["TU Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"TU Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087003217","display_name":"Joachim Gudmundsson","orcid":"https://orcid.org/0000-0002-6778-7990"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Joachim Gudmundsson","raw_affiliation_strings":["University of Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"University of Sydney, Australia","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025874928","display_name":"Mehran Mehr","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Mehran Mehr","raw_affiliation_strings":["TU Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"TU Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028410825"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":4.3335,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.94395538,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"14","issue":"3","first_page":"1","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9959999918937683,"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"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9959999918937683,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9948999881744385,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9937000274658203,"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/combinatorics","display_name":"Combinatorics","score":0.7170736193656921},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6415058970451355},{"id":"https://openalex.org/keywords/ball","display_name":"Ball (mathematics)","score":0.5784430503845215},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5249433517456055},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.5109704732894897},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4962828755378723},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.47481024265289307},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4443429708480835},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3749399781227112},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10222536325454712}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7170736193656921},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6415058970451355},{"id":"https://openalex.org/C122041747","wikidata":"https://www.wikidata.org/wiki/Q838611","display_name":"Ball (mathematics)","level":2,"score":0.5784430503845215},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5249433517456055},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.5109704732894897},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4962828755378723},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.47481024265289307},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4443429708480835},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3749399781227112},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10222536325454712},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3186990","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3186990","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/81280b4b-29bf-4db5-a433-d42e34d69a65","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/81280b4b-29bf-4db5-a433-d42e34d69a65","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"de Berg, M T, Gudmundsson, J & Mehr, M 2018, 'Faster algorithms for computing plurality points', ACM Transactions on Algorithms, vol. 14, no. 3, 36. https://doi.org/10.1145/3186990","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/81280b4b-29bf-4db5-a433-d42e34d69a65","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/81280b4b-29bf-4db5-a433-d42e34d69a65","pdf_url":"https://research.tue.nl/nl/publications/81280b4b-29bf-4db5-a433-d42e34d69a65","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Algorithms, 14(3):36. Association for Computing Machinery, Inc","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:publications/81280b4b-29bf-4db5-a433-d42e34d69a65","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85052562251&partnerID=8YFLogxK","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"de Berg, M T, Gudmundsson, J & Mehr, M 2018, 'Faster algorithms for computing plurality points', ACM Transactions on Algorithms, vol. 14, no. 3, 36. https://doi.org/10.1145/3186990","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/81280b4b-29bf-4db5-a433-d42e34d69a65","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/81280b4b-29bf-4db5-a433-d42e34d69a65","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"de Berg, M T, Gudmundsson, J & Mehr, M 2018, 'Faster algorithms for computing plurality points', ACM Transactions on Algorithms, vol. 14, no. 3, 36. https://doi.org/10.1145/3186990","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1423077225","display_name":null,"funder_award_id":"024.002.003","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"},{"id":"https://openalex.org/G3847954009","display_name":null,"funder_award_id":"DP150101134","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"},{"id":"https://openalex.org/G6942702551","display_name":null,"funder_award_id":"024.002.003 and 022.005.025","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W171938736","https://openalex.org/W302489132","https://openalex.org/W1495675361","https://openalex.org/W1560036661","https://openalex.org/W1977946998","https://openalex.org/W1986342566","https://openalex.org/W1989292586","https://openalex.org/W1997964544","https://openalex.org/W2014265507","https://openalex.org/W2022266599","https://openalex.org/W2024181435","https://openalex.org/W2042179241","https://openalex.org/W2048057617","https://openalex.org/W2048493433","https://openalex.org/W2051690202","https://openalex.org/W2059985428","https://openalex.org/W2080695516","https://openalex.org/W2118282394","https://openalex.org/W2120934134","https://openalex.org/W2142339475","https://openalex.org/W2150123893","https://openalex.org/W3114932062","https://openalex.org/W4211070029","https://openalex.org/W4213071546","https://openalex.org/W4235244481","https://openalex.org/W4246384432","https://openalex.org/W4300640952","https://openalex.org/W6787907487"],"related_works":["https://openalex.org/W2004283824","https://openalex.org/W2113270940","https://openalex.org/W1581210843","https://openalex.org/W1998702677","https://openalex.org/W1992104669","https://openalex.org/W1982530285","https://openalex.org/W2521054645","https://openalex.org/W1830048115","https://openalex.org/W2515993118","https://openalex.org/W2887154986"],"abstract_inverted_index":{"Let":[0],"V":[1,37,85,115,118,149,213],"be":[2],"a":[3,33,51,87,110,122,128,151],"set":[4,207],"of":[5,208,212],"n":[6,79,81,201,228],"points":[7,211],"in":[8,76,90,138,198],"R":[9,20,30,171],"d":[10,21,31,159,172,179,202],",":[11],"which":[12],"we":[13,134,195],"call":[14],"voters.":[15],"A":[16,46],"point":[17,26,47,53,67,89,146,168],"p":[18,27,40,44,48,68,169,190],"\u2208":[19,29,36,148,170],"is":[22,49,56,173],"preferred":[23,57],"over":[24],"another":[25],"\u2032":[28],"by":[32,58,175],"voter":[34],"\u03c5":[35,147,165],"if":[38,54,96],"dist(\u03c5,":[39,43],")":[41,82,204],"<":[42],"\u2032).":[45],"called":[50],"plurality":[52,88,101,123,131,210],"it":[55],"at":[59],"least":[60],"as":[61,64],"many":[62],"voters":[63],"any":[65,167],"other":[66],"\u2032.":[69],"We":[70,103],"present":[71],"an":[72],"algorithm":[73],"that":[74,117],"decides":[75],"O":[77,199,226],"(":[78,189,200,227],"log":[80],"time":[83,205,223],"whether":[84],"admits":[86,121],"the":[91,99,136,139,162,206,221],"L":[92,141],"2":[93],"norm":[94],"and,":[95],"so,":[97],"finds":[98],"(unique)":[100],"point.":[102],"also":[104],"give":[105],"efficient":[106],"algorithms":[107],"to":[108,126,166,225],"compute":[109,127,197],"minimum-cost":[111],"subset":[112],"W":[113,120],"\u2282":[114],"such":[116],"\\":[119],"point,":[124],"and":[125,161],"so-called":[129],"minimum-radius":[130],"ball.":[132],"Finally,":[133],"consider":[135],"problem":[137],"personalized":[140],"1":[142,156],"norm,":[143],"where":[144],"each":[145],"has":[150],"preference":[152,217],"vector":[153],"\u2329":[154],"w":[155,158,180],"(\u03c5),\u2026,":[157],"(\u03c5)\u232a":[160],"distance":[163],"from":[164],"given":[174],"\u2211":[176],"i":[177,181,185,188],"=1":[178],"(\u03c5)\u00b7":[182],"|":[183],"x":[184,187],"(\u03c5)\u2212":[186],")|.":[191],"For":[192],"this":[193],"case":[194],"can":[196],"\u22121":[203],"all":[209,216],".":[214],"When":[215],"vectors":[218],"are":[219],"equal,":[220],"running":[222],"improves":[224],").":[229]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2}],"updated_date":"2026-03-13T16:22:10.518609","created_date":"2025-10-10T00:00:00"}