English
Related papers

Related papers: The Complexity of Probabilistic Lobbying

200 papers

We consider Incentive Decision Processes, where a principal seeks to reduce its costs due to another agent's behavior, by offering incentives to the agent for alternate behavior. We focus on the case where a principal interacts with a…

Computer Science and Game Theory · Computer Science 2012-10-19 Sashank J. Reddi , Emma Brunskill

The successive and the amendment procedures have been widely employed in parliamentary and legislative decision making and have undergone extensive study in the literature from various perspectives. However, investigating them through the…

Computer Science and Game Theory · Computer Science 2025-03-19 Yongjie Yang

We consider the approval-based model of elections, and undertake a computational study of voting rules which select committees whose size is not predetermined. While voting rules that output committees with a predetermined number of winning…

Computer Science and Game Theory · Computer Science 2017-11-20 Piotr Faliszewski , Arkadii Slinko , Nimrod Talmon

An alternative voting scheme is proposed to fill the democratic gap between a president elected democratically via universal suffrage (deterministic outcome, the actual majority decides), and a president elected by one person randomly…

Physics and Society · Physics 2017-01-11 Serge Galam

A central theme in computational social choice is to study the extent to which voting systems computationally resist manipulative attacks seeking to influence the outcome of elections, such as manipulation (i.e., strategic voting), control,…

Computer Science and Game Theory · Computer Science 2013-07-30 Piotr Faliszewski , Yannick Reisch , Jörg Rothe , Lena Schend

Argumentation problems are concerned with determining the acceptability of a set of arguments from their relational structure. When the available information is uncertain, probabilistic argumentation frameworks provide modelling tools to…

Artificial Intelligence · Computer Science 2023-04-18 Pietro Totis , Angelika Kimmig , Luc De Raedt

We study the control complexity of fallback voting. Like manipulation and bribery, electoral control describes ways of changing the outcome of an election; unlike manipulation or bribery attempts, control actions---such as…

Computer Science and Game Theory · Computer Science 2010-04-21 Gábor Erdélyi , Lena Piras , Jörg Rothe

In an election, we are given a set of voters, each having a preference list over a set of candidates, that are distributed on a social network. We consider a scenario where voters may change their preference lists as a consequence of the…

Social and Information Networks · Computer Science 2020-06-01 Mohammad Abouei Mehrizi , Gianlorenzo D'Angelo

We study the computational complexity of committee selection problem for several approval-based voting rules in the presence of outliers. Our first result shows that outlier consideration makes committee selection problem intractable for…

Multiagent Systems · Computer Science 2015-11-16 Palash Dey , Neeldhara Misra , Y. Narahari

Non-linear voter models assume that the opinion of an agent depends on the opinions of its neighbors in a non-linear manner. This allows for voting rules different from majority voting. While the linear voter model is known to reach…

Physics and Society · Physics 2016-04-27 Frank Schweitzer , Laxmidhar Behera

Persuasion studies how a principal can influence agents' decisions via strategic information revelation --- often described as a signaling scheme --- in order to yield the most desirable equilibrium outcome. Recently, there has been a large…

Computer Science and Game Theory · Computer Science 2019-10-22 Haifeng Xu

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

Given a set of agents with approval preferences over each other, we study the task of finding $k$ matchings fairly representing everyone's preferences. We model the problem as an approval-based multiwinner election where the set of…

Computer Science and Game Theory · Computer Science 2021-02-16 Niclas Boehmer , Markus Brill , Ulrike Schmidt-Kraepelin

Agent-based models of the binary naming game are generalized here to represent a family of models parameterized by the introduction of two continuous parameters. These parameters define varying listener-speaker interactions on the…

Physics and Society · Physics 2014-10-17 Andrew M. Thompson , Boleslaw K. Szymanski , Chjan C. Lim

Decision-making methods very often use the technique of comparing alternatives in pairs. In this approach, experts are asked to compare different options, and then a quantitative ranking is created from the results obtained. It is commonly…

Artificial Intelligence · Computer Science 2025-04-21 M. Strada , K. Kułakowski

We study computational questions in a game-theoretic model that, in particular, aims to capture advertising/persuasion applications such as viral marketing. Specifically, we consider a multi-agent Bayesian persuasion model where an informed…

Computer Science and Game Theory · Computer Science 2016-03-07 Yakov Babichenko , Siddharth Barman

Applying automated reasoning tools for decision support and analysis in law has the potential to make court decisions more transparent and objective. Since there is often uncertainty about the accuracy and relevance of evidence,…

Artificial Intelligence · Computer Science 2020-09-15 Inga Ibs , Nico Potyka

Election rules are formal processes that aggregate voters preferences, typically to select a single candidate, called the winner. Most of the election rules studied in the literature require the voters to rank the candidates from the most…

Data Structures and Algorithms · Computer Science 2019-01-31 Matthias Bentert , Piotr Skowron

In this paper, we propose a simple and intuitive model to investigate the efficiency of the two-party election system, especially regarding the nomination process. Each of the two parties has its own candidates, and each of them brings…

Computer Science and Game Theory · Computer Science 2020-06-29 Chuang-Chieh Lin , Chi-Jen Lu , Po-An Chen

Online social networks are used to diffuse opinions and ideas among users, enabling a faster communication and a wider audience. The way in which opinions are conditioned by social interactions is usually called social influence. Social…

Social and Information Networks · Computer Science 2019-07-03 Federico Corò , Emilio Cruciani , Gianlorenzo D'Angelo , Stefano Ponziani
‹ Prev 1 8 9 10 Next ›