English
Related papers

Related papers: Strategic Voting and the Logic of Knowledge

200 papers

We propose a framework for strategic voting when a voter may lack knowledge about the preferences of other voters, or about other voters' knowledge about her own preference. In this setting we define notions of manipulation, equilibrium,…

Computer Science and Game Theory · Computer Science 2021-11-30 Zeinab Bakhtiari , Hans van Ditmarsch , Abdallah Saffidine

Much of the theoretical work on strategic voting makes strong assumptions about what voters know about the voting situation. A strategizing voter is typically assumed to know how other voters will vote and to know the rules of the voting…

Multiagent Systems · Computer Science 2019-07-23 Wesley H. Holliday , Eric Pacuit

We study the voting game where agents' preferences are endogenously decided by the information they receive, and they can collaborate in a group. We show that strategic voting behaviors have a positive impact on leading to the ``correct''…

Computer Science and Game Theory · Computer Science 2023-05-23 Qishen Han , Grant Schoenebeck , Biaoshuai Tao , Lirong Xia

We present a new strategic voting model where we use uncertainty representation to model preferences. Specifically, we use probability sets as uncertainty representations, together with lower and upper expected utility gains to take…

Computer Science and Game Theory · Computer Science 2026-05-18 Henri Surugue , Sébastien Destercke

The question of how people vote strategically under uncertainty has attracted much attention in several disciplines. Theoretical decision models have been proposed which vary in their assumptions on the sophistication of the voters and on…

Computer Science and Game Theory · Computer Science 2018-05-22 Roy Fairstein , Adam Lauz , Kobi Gal , Reshef Meir

Strategic voting, or manipulation, is the process by which a voter misrepresents his preferences in an attempt to elect an outcome that he considers preferable to the outcome under sincere voting. It is generally agreed that manipulation is…

Computer Science and Game Theory · Computer Science 2022-11-10 Egor Ianovski , Daria Teplova , Valeriia Kuka

Machine learning systems have been widely used to make decisions about individuals who may behave strategically to receive favorable outcomes, e.g., they may genuinely improve the true labels or manipulate observable features directly to…

Artificial Intelligence · Computer Science 2024-10-30 Tian Xie , Zhiqun Zuo , Mohammad Mahdi Khalili , Xueru Zhang

By the Gibbard--Satterthwaite theorem, every reasonable voting rule for three or more alternatives is susceptible to manipulation: there exist elections where one or more voters can change the election outcome in their favour by…

Computer Science and Game Theory · Computer Science 2017-07-28 Edith Elkind , Umberto Grandi , Francesca Rossi , Arkadii Slinko

In repeated-game applications where both the collusive and non-collusive outcomes can be supported as equilibria, researchers must resolve underlying selection questions if theory will be used to understand counterfactual policies. One…

General Economics · Economics 2021-01-18 Emanuel Vespa , Taylor Weidman , Alistair J. Wilson

Coalitional manipulation in voting is considered to be any scenario in which a group of voters decide to misrepresent their vote in order to secure an outcome they all prefer to the first outcome of the election when they vote honestly. The…

Theoretical Economics · Economics 2020-09-28 Mostapha Diss , Boris Tsvelikhovskiy

It is well known that no reasonable voting rule is strategyproof. Moreover, the common Plurality rule is particularly prone to strategic behavior of the voters and empirical studies show that people often vote strategically in practice.…

Computer Science and Game Theory · Computer Science 2014-04-22 Reshef Meir , Omer Lev , Jeffrey S. Rosenschein

Integrity of elections is vital to democratic systems, but it is frequently threatened by malicious actors. The study of algorithmic complexity of the problem of manipulating election outcomes by changing its structural features is known as…

Computer Science and Game Theory · Computer Science 2020-07-21 Andrew Estornell , Sanmay Das , Edith Elkind , Yevgeniy Vorobeychik

We extend the formalism of Conjectural Variations games to Stackelberg games involving multiple leaders and a single follower. To solve these nonconvex games, a common assumption is that the leaders compute their strategies having perfect…

Computer Science and Game Theory · Computer Science 2025-07-24 Francesco Morri , Hélène Le Cadre , Luce Brotcorne

Complexity of voting manipulation is a prominent topic in computational social choice. In this work, we consider a two-stage voting manipulation scenario. First, a malicious party (an attacker) attempts to manipulate the election outcome in…

Computer Science and Game Theory · Computer Science 2019-06-18 Edith Elkind , Jiarui Gan , Svetlana Obraztsova , Zinovi Rabinovich , Alexandros A. Voudouris

Understanding the nature of strategic voting is the holy grail of social choice theory, where game-theory, social science and recently computational approaches are all applied in order to model the incentives and behavior of voters. In a…

Multiagent Systems · Computer Science 2014-11-19 Reshef Meir

When users stand to gain from certain predictions, they are prone to act strategically to obtain favorable predictive outcomes. Whereas most works on strategic classification consider user actions that manifest as feature modifications, we…

Machine Learning · Computer Science 2024-06-25 Guy Horowitz , Yonatan Sommer , Moran Koren , Nir Rosenfeld

It is important to study how strategic agents can affect the outcome of an election. There has been a long line of research in the computational study of elections on the complexity of manipulative actions such as manipulation and bribery.…

Computer Science and Game Theory · Computer Science 2023-07-24 Zack Fitzsimmons , Edith Hemaspaandra

The integrity of elections is central to democratic systems. However, a myriad of malicious actors aspire to influence election outcomes for financial or political benefit. A common means to such ends is by manipulating perceptions of the…

Computer Science and Game Theory · Computer Science 2022-06-22 Junlin Wu , Andrew Estornell , Lecheng Kong , Yevgeniy Vorobeychik

We study the voting problem with two alternatives where voters' preferences depend on a not-directly-observable state variable. While equilibria in the one-round voting mechanisms lead to a good decision, they are usually hard to compute…

Computer Science and Game Theory · Computer Science 2025-05-16 Qishen Han , Grant Schoenebeck , Biaoshuai Tao , Lirong Xia

We consider manipulation problems when the manipulator only has partial information about the votes of the nonmanipulators. Such partial information is described by an information set, which is the set of profiles of the nonmanipulators…

Artificial Intelligence · Computer Science 2011-06-28 Vincent Conitzer , Toby Walsh , Lirong Xia
‹ Prev 1 2 3 10 Next ›