{"id":"https://openalex.org/W4415428037","doi":"https://doi.org/10.3233/faia251251","title":"Optimal Candidate Positioning in Multi-Issue Elections","display_name":"Optimal Candidate Positioning in Multi-Issue Elections","publication_year":2025,"publication_date":"2025-10-21","ids":{"openalex":"https://openalex.org/W4415428037","doi":"https://doi.org/10.3233/faia251251"},"language":null,"primary_location":{"id":"doi:10.3233/faia251251","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia251251","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.3233/faia251251","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018876457","display_name":"Colin Cleveland","orcid":"https://orcid.org/0000-0003-0909-7518"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Colin Cleveland","raw_affiliation_strings":["King\u2019s College London"],"affiliations":[{"raw_affiliation_string":"King\u2019s College London","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091684842","display_name":"Bart de Keijzer","orcid":"https://orcid.org/0000-0001-9465-0837"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Bart de Keijzer","raw_affiliation_strings":["King\u2019s College London"],"affiliations":[{"raw_affiliation_string":"King\u2019s College London","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065622718","display_name":"Maria Polukarov","orcid":"https://orcid.org/0000-0002-7421-3012"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Maria Polukarov","raw_affiliation_strings":["King\u2019s College London"],"affiliations":[{"raw_affiliation_string":"King\u2019s College London","institution_ids":["https://openalex.org/I183935753"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5018876457"],"corresponding_institution_ids":["https://openalex.org/I183935753"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.63212928,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.98580002784729,"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.98580002784729,"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/T10108","display_name":"Electoral Systems and Political Participation","score":0.9638000130653381,"subfield":{"id":"https://openalex.org/subfields/3320","display_name":"Political Science and International Relations"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5501000285148621},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.45399999618530273},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43140000104904175},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.31940001249313354},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.30979999899864197}],"concepts":[{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5501000285148621},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.548799991607666},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.45399999618530273},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43140000104904175},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39070001244544983},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35199999809265137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.349700003862381},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.31940001249313354},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31940001249313354},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30979999899864197},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2948000133037567},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.28940001130104065},{"id":"https://openalex.org/C63002673","wikidata":"https://www.wikidata.org/wiki/Q2260590","display_name":"Scoring rule","level":2,"score":0.28450000286102295},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.27469998598098755},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2637999951839447}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/faia251251","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia251251","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.3233/faia251251","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia251251","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,34,84],"study":[1],"strategic":[2],"candidate":[3,23,44],"positioning":[4],"in":[5,16],"multidimensional":[6],"spatial-voting":[7],"elections.":[8],"Voters":[9],"and":[10,18,69,96,111,123],"candidates":[11],"are":[12],"represented":[13],"as":[14,109],"points":[15],"Rd":[17],"each":[19],"voter":[20],"supports":[21],"the":[22,59,81,87,92,116],"that":[24,36],"is":[25,45,61],"closest":[26],"under":[27],"a":[28,42,49,54],"distance":[29],"induced":[30],"by":[31],"an":[32,38,63,70],"\u2113p-norm.":[33],"prove":[35],"computing":[37],"optimal":[39],"location":[40],"for":[41,53,76,91,128],"new":[43],"NP-hard":[46],"already":[47],"against":[48],"single":[50],"opponent,":[51],"whereas":[52],"constant":[55],"number":[56],"of":[57,119],"issues":[58],"problem":[60],"tractable:":[62],"O(nd":[64],"+":[65],"1)":[66],"hyperplane-enumeration":[67],"algorithm":[68],"O(n":[71],"log":[72],"n)":[73],"radial-sweep":[74],"routine":[75],"d":[77],"=":[78],"2":[79],"solve":[80],"task":[82],"exactly.":[83],"further":[85],"derive":[86],"first":[88],"approximation":[89],"guarantees":[90],"general":[93],"multi-candidate":[94],"case":[95],"show":[97],"how":[98],"our":[99],"geometric":[100],"approach":[101],"extends":[102],"seamlessly":[103],"to":[104],"positional":[105],"scoring":[106],"rules":[107],"such":[108],"k-approval":[110],"Borda.":[112],"These":[113],"results":[114],"clarify":[115],"algorithmic":[117],"landscape":[118],"multi-dimensional":[120],"spatial":[121],"elections":[122],"provide":[124],"practically":[125],"implementable":[126],"tools":[127],"campaign":[129],"strategy.":[130]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-24T00:00:00"}