English
Related papers

Related papers: Strategic Behavior is Bliss: Iterative Voting Impr…

200 papers

Iterative voting is a natural model of repeated strategic decision-making in social choice theory when agents have the opportunity to update their votes prior to finalizing the group decision. Prior work has analyzed the efficacy of…

Computer Science and Game Theory · Computer Science 2025-06-12 Joshua Kavner , Lirong Xia

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

When consequential decisions are informed by algorithmic input, individuals may feel compelled to alter their behavior in order to gain a system's approval. Models of agent responsiveness, termed "strategic manipulation," analyze the…

Machine Learning · Computer Science 2019-05-13 Lily Hu , Nicole Immorlica , Jennifer Wortman Vaughan

The robustness of multiagent systems can be affected by mistakes or behavioral biases (e.g., risk-aversion, altruism, toll-sensitivity), with some agents playing the "wrong game." This can change the set of equilibria, and may in turn harm…

Computer Science and Game Theory · Computer Science 2018-03-14 Reshef Meir , David Parkes

We consider a simple sequential allocation procedure for sharing indivisible items between agents in which agents take turns to pick items. Supposing additive utilities and independence between the agents, we show that the expected utility…

Artificial Intelligence · Computer Science 2013-04-24 Thomas Kalinowski , Nina Nardoytska , Toby Walsh

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

In a combinatorial auction with item bidding, agents participate in multiple single-item second-price auctions at once. As some items might be substitutes, agents need to strategize in order to maximize their utilities. A number of results…

Computer Science and Game Theory · Computer Science 2017-04-17 Paul Dütting , Thomas Kesselheim

In multiagent systems, the complex interaction of fixed incentives can lead agents to outcomes that are poor (inefficient) not only for the group, but also for each individual. Price of anarchy is a technical, game-theoretic definition that…

This paper examines the impact of agents' myopic optimization on the efficiency of systems comprised by many selfish agents. In contrast to standard congestion games where agents interact in a one-shot fashion, in our model each agent…

Computer Science and Game Theory · Computer Science 2025-04-30 Yunpeng Li , Antonis Dimakis , Costas A. Courcoubetis

We consider the problem of repeatedly choosing policies to maximize social welfare. Welfare is a weighted sum of private utility and public revenue. Earlier outcomes inform later policies. Utility is not observed, but indirectly inferred.…

Econometrics · Economics 2024-07-30 Nicolo Cesa-Bianchi , Roberto Colomboni , Maximilian Kasy

Motivated by the success of the serial dictatorship mechanism in social choice settings, we explore its usefulness in tackling various combinatorial optimization problems. We do so by considering an abstract model, in which a set of agents…

Computer Science and Game Theory · Computer Science 2022-09-09 Ioannis Caragiannis , Nidhi Rathi

Social media platforms systematically reward popularity over authenticity, incentivizing users to strategically tailor their expression for attention. In this paper, we introduce (i) popularity as a strategic expression mechanism, distinct…

General Economics · Economics 2026-03-03 Zafer Kanik , Zaruhi Hakobyan

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

The Price of Anarchy (PoA) is a standard metric for quantifying inefficiency in socio-technical systems, widely used to guide policies like traffic tolling. Conventional PoA analysis relies on exact numerical costs. However, in many…

Computer Science and Game Theory · Computer Science 2025-12-08 Ilia Shilov , Mingjia He , Heinrich H. Nax , Emilio Frazzoli , Gioele Zardini , Saverio Bolognani

In several socioeconomic-critical decision-making settings, such as fair resource allocation, climate policy, or AI alignment, multiple principals interact within a common arena. While it is well established that these principals may have…

Computer Science and Game Theory · Computer Science 2026-05-13 Sarvin Bahmani , Soumyajit Paul , Sven Schewe , Shadi Tasdighi Kalat , Ashutosh Trivedi

Agents vote to choose a fair mixture of public outcomes; each agent likes or dislikes each outcome. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a variant of the random dictator, is Strategyproof and…

Computer Science and Game Theory · Computer Science 2017-12-08 Haris Aziz , Anna Bogomolnaia , Herve Moulin

The rise of artificial intelligence (A.I.) based systems is already offering substantial benefits to the society as a whole. However, these systems may also enclose potential conflicts and unintended consequences. Notably, people will tend…

Computers and Society · Computer Science 2020-12-23 Pedro Fernandes , Francisco C. Santos , Manuel Lopes

Agents often have individual goals which depend on a group's actions. If agents trust a forecast of collective action and adapt strategically, such prediction can influence outcomes non-trivially, resulting in a form of performative…

Machine Learning · Computer Science 2025-02-18 António Góis , Mehrnaz Mofakhami , Fernando P. Santos , Gauthier Gidel , Simon Lacoste-Julien

We study proportional representation in the temporal voting model, where collective decisions are made repeatedly over time over a fixed horizon. Prior work has extensively investigated how proportional representation axioms from…

Computer Science and Game Theory · Computer Science 2026-05-13 Nicholas Teh

Most analyses of manipulation of voting schemes have adopted two assumptions that greatly diminish their practical import. First, it is usually assumed that the manipulators have full knowledge of the votes of the nonmanipulating agents.…

Computer Science and Game Theory · Computer Science 2012-10-19 Tyler Lu , Pingzhong Tang , Ariel D. Procaccia , Craig Boutilier
‹ Prev 1 2 3 10 Next ›