How hard is it to control an election?-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

How hard is it to control an election?

Published:1992-08 Issue:8-9 Volume:16 Page:27-40
ISSN:0895-7177
Container-title:Mathematical and Computer Modelling
language:en
Short-container-title:Mathematical and Computer Modelling

Author:

Bartholdi John J.,Tovey Craig A.,Trick Michael A.

Publisher

Elsevier BV

Subject

Computer Science Applications,Modelling and Simulation

Reference16 articles.

1. Axiomatic social choice theory: An overview and interpretation;Plott;American Journal of Political Science,1976

2. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

3. Theories of bounded rationality;Simon,1972

4. Recognizing majority-rule equilibrium in spatial voting models;Bartholdi;Social Choice and Welfare,1991

5. Single transferable vote resists strategic voting;Bartholdi;Social Choice and Welfare,1991

Cited by 203 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parameterized complexity of candidate nomination for elections based on positional scoring rules;Autonomous Agents and Multi-Agent Systems;2024-07-01

2. Primarily about primaries;Artificial Intelligence;2024-04

3. Group control for procedural rules: parameterized complexity and consecutive domains;Frontiers of Computer Science;2024-01-22

4. Apportionment with Thresholds: Strategic Campaigns are Easy in the Top-Choice but Hard in the Second-Chance Mode;Lecture Notes in Computer Science;2024

5. Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas;Information and Computation;2024-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP