Hardness of candidate nomination

IF 2 3区计算机科学 Q3 AUTOMATION & CONTROL SYSTEMS Autonomous Agents and Multi-Agent Systems Pub Date : 2023-08-16 DOI:10.1007/s10458-023-09622-9

Katarína Cechlárová, Julien Lesca, Diana Trellová, Martina Hančová, Jozef Hanč

{"title":"Hardness of candidate nomination","authors":"Katarína Cechlárová, Julien Lesca, Diana Trellová, Martina Hančová, Jozef Hanč","doi":"10.1007/s10458-023-09622-9","DOIUrl":null,"url":null,"abstract":"<div>We consider elections where the set of candidates is split into parties and each party can nominate just one candidate. We study the computational complexity of two problems. The Possible President problem asks whether a given party candidate can become the unique winner of the election for some nominations from other parties. The Necessary President is the problem to decide whether a given candidate will be the unique winner of the election for any possible nominations from other parties. We consider several different voting rules and show that for all of them the Possible President problem is NP-complete, even if the size of each party is at most two; for some voting rules we prove that the Necessary President is coNP-complete. Further, we formulate integer programs to solve the Possible President and Necessary President problems and test them on real and artificial data.</div>","PeriodicalId":55586,"journal":{"name":"Autonomous Agents and Multi-Agent Systems","volume":"37 2","pages":""},"PeriodicalIF":2.0000,"publicationDate":"2023-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10458-023-09622-9.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Autonomous Agents and Multi-Agent Systems","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10458-023-09622-9","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}

引用次数: 0

Abstract

We consider elections where the set of candidates is split into parties and each party can nominate just one candidate. We study the computational complexity of two problems. The Possible President problem asks whether a given party candidate can become the unique winner of the election for some nominations from other parties. The Necessary President is the problem to decide whether a given candidate will be the unique winner of the election for any possible nominations from other parties. We consider several different voting rules and show that for all of them the Possible President problem is NP-complete, even if the size of each party is at most two; for some voting rules we prove that the Necessary President is coNP-complete. Further, we formulate integer programs to solve the Possible President and Necessary President problems and test them on real and artificial data.

Abstract Image

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

候选人提名的难度

我们考虑的选举是将候选人分为几个政党，每个政党只能提名一名候选人。我们研究了两个问题的计算复杂性。“可能的总统”问题询问某一政党候选人是否能成为其他政党某些提名的唯一赢家。必要的总统是决定特定候选人是否会成为其他政党任何可能提名的唯一获胜者的问题。我们考虑了几种不同的投票规则，并表明对于所有这些规则，可能的总统问题都是NP完全的，即使每个政党的规模最多为两个；对于某些投票规则，我们证明了必要总统是coNP完备的。此外，我们制定了整数程序来解决可能的总统和必要的总统问题，并在真实数据和人工数据上进行了测试。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Autonomous Agents and Multi-Agent Systems 工程技术-计算机：人工智能

CiteScore

6.00

自引率

5.30%

发文量

审稿时长

>12 weeks

期刊介绍： This is the official journal of the International Foundation for Autonomous Agents and Multi-Agent Systems. It provides a leading forum for disseminating significant original research results in the foundations, theory, development, analysis, and applications of autonomous agents and multi-agent systems. Coverage in Autonomous Agents and Multi-Agent Systems includes, but is not limited to: Agent decision-making architectures and their evaluation, including: cognitive models; knowledge representation; logics for agency; ontological reasoning; planning (single and multi-agent); reasoning (single and multi-agent) Cooperation and teamwork, including: distributed problem solving; human-robot/agent interaction; multi-user/multi-virtual-agent interaction; coalition formation; coordination Agent communication languages, including: their semantics, pragmatics, and implementation; agent communication protocols and conversations; agent commitments; speech act theory Ontologies for agent systems, agents and the semantic web, agents and semantic web services, Grid-based systems, and service-oriented computing Agent societies and societal issues, including: artificial social systems; environments, organizations and institutions; ethical and legal issues; privacy, safety and security; trust, reliability and reputation Agent-based system development, including: agent development techniques, tools and environments; agent programming languages; agent specification or validation languages Agent-based simulation, including: emergent behavior; participatory simulation; simulation techniques, tools and environments; social simulation Agreement technologies, including: argumentation; collective decision making; judgment aggregation and belief merging; negotiation; norms Economic paradigms, including: auction and mechanism design; bargaining and negotiation; economically-motivated agents; game theory (cooperative and non-cooperative); social choice and voting Learning agents, including: computational architectures for learning agents; evolution, adaptation; multi-agent learning. Robotic agents, including: integrated perception, cognition, and action; cognitive robotics; robot planning (including action and motion planning); multi-robot systems. Virtual agents, including: agents in games and virtual environments; companion and coaching agents; modeling personality, emotions; multimodal interaction; verbal and non-verbal expressiveness Significant, novel applications of agent technology Comprehensive reviews and authoritative tutorials of research and practice in agent systems Comprehensive and authoritative reviews of books dealing with agents and multi-agent systems.