English
Related papers

Related papers: Pareto Efficient Nash Implementation Via Approval …

200 papers

Since the seminal PPAD-completeness result for computing a Nash equilibrium even in two-player games, an important line of research has focused on relaxations achievable in polynomial time. In this paper, we consider the notion of…

Computer Science and Game Theory · Computer Science 2022-07-15 Argyrios Deligkas , Michail Fasoulakis , Evangelos Markakis

We focus on the one-to-one two-sided matching model with two disjoint sets of agents of equal size, where each agent in a set has preferences on the agents in the other set modeled by a linear order. A matching mechanism associates a set of…

Theoretical Economics · Economics 2024-11-27 Daniela Bubboloni , Michele Gori , Claudia Meo

We introduce a new framework to study the group dynamics and game-theoretic considerations when voters in a committee are allowed to trade votes. This model represents a significant step forward by considering vote-for-vote trades in a…

Theoretical Economics · Economics 2024-06-17 Matthew I. Jones

Wagering mechanisms are one-shot betting mechanisms that elicit agents' predictions of an event. For deterministic wagering mechanisms, an existing impossibility result has shown incompatibility of some desirable theoretical properties. In…

Computer Science and Game Theory · Computer Science 2022-03-31 Yiling Chen , Yang Liu , Juntao Wang

We deal with the generalized Nash game proposed by Rosen, which is a game with strategy sets that are coupled across players through a shared constraint. A reduction to a classical game is shown, and as a consequence, Rosen's result can be…

Optimization and Control · Mathematics 2023-07-10 Carlos Calderón , John Cotrina

In the framework of finite games in extensive form with perfect information and strict preferences, this paper introduces a new equilibrium concept: the Perfect Prediction Equilibrium (PPE). In the Nash paradigm, rational players consider…

Computer Science and Game Theory · Computer Science 2021-02-01 Ghislain Fourny , Stéphane Reiche , Jean-Pierre Dupuy

We consider a one-sided assignment market or exchange network with transferable utility and propose a model for the dynamics of bargaining in such a market. Our dynamical model is local, involving iterative updates of 'offers' based on…

Computer Science and Game Theory · Computer Science 2015-03-14 Mohsen Bayati , Christian Borgs , Jennifer Chayes , Yashodhan Kanoria , Andrea Montanari

This paper studies manipulation of belief aggregation rules in the setting where the society first collects individual's probabilistic opinions and then solves a public portfolio choice problem with common utility based on the aggregate…

Theoretical Economics · Economics 2024-05-06 Christopher P. Chambers , Federico Echenique , Takashi Hayashi

Attention-Aware Social Choice tackles the fundamental conflict faced by some agent communities between their desire to include all members in the decision making processes and the limited time and attention that are at the disposal of the…

Computers and Society · Computer Science 2023-09-25 Lior Ashkenazy , Nimrod Talmon

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 study mean field portfolio games under Epstein-Zin preferences, which naturally encompass the classical time-additive power utility as a special case. In a general non-Markovian framework, we establish a uniqueness result by proving a…

Mathematical Finance · Quantitative Finance 2025-05-13 Guanxing Fu , Ulrich Horst

We consider repeated allocation of a shared resource via a non-monetary mechanism, wherein a single item must be allocated to one of multiple agents in each round. We assume that each agent has i.i.d. values for the item across rounds, and…

Computer Science and Game Theory · Computer Science 2025-11-07 David X. Lin , Siddhartha Banerjee , Giannis Fikioris , Éva Tardos

In mechanism design theory, a designer would like to implement a desired social choice function which specifies her favorite outcome for each possible profile of agents' types. To do so, the designer constructs a mechanism which describes…

Computer Science and Game Theory · Computer Science 2019-05-02 Haoyang Wu

We solve the two-player bargaining problem employing Weber's law in psychophysics, which is applied to the perception of utility changes. Using this law, the players define the jointly acceptable range of utilities on the Pareto line, which…

Theoretical Economics · Economics 2025-01-14 V. G. Bardakhchyan , A. E. Allahverdyan

We consider the multi-sender persuasion problem: multiple players with informational advantage signal to convince a single self-interested actor to take certain actions. This problem generalizes the seminal Bayesian Persuasion framework and…

Artificial Intelligence · Computer Science 2024-06-21 Safwan Hossain , Tonghan Wang , Tao Lin , Yiling Chen , David C. Parkes , Haifeng Xu

The problem of peer selection, which randomly selects a peer from a set, is commonplace in Proof-of-Stake (PoS) protocols. In PoS, peers are chosen randomly with probability proportional to the amount of stake that they possess. This paper…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-11-13 Quan Nguyen , Andre Cronje , Michael Kong

We study the consequences of adopting products by agents who form a social network. To this end we use the threshold model introduced in Apt and Markakis, arXiv:1105.2434, in which the nodes influenced by their neighbours can adopt one out…

Social and Information Networks · Computer Science 2012-11-30 Sunil Simon , Krzysztof R. Apt

A Nash Equilibrium (NE) is a strategy profile resilient to unilateral deviations, and is predominantly used in the analysis of multiagent systems. A downside of NE is that it is not necessarily stable against deviations by coalitions. Yet,…

Computer Science and Game Theory · Computer Science 2014-01-16 Michal Feldman , Tami Tamir

In this contribution we analyze the effect that mutual information has on the actual performance of efficient negotiation methods. Specifically, we start by proposing the theoretical notion of Abstract Negotiation Method (ANM) as a map from…

Optimization and Control · Mathematics 2012-06-19 Luca Barzanti , Marcello Mastroleo

Budget aggregation is a process in which citizens vote by declaring their individual ideal budget allocation, and a pre-determined rule aggregates all votes into a single outcome. Recent theoretical work has proposed various aggregation…

Computer Science and Game Theory · Computer Science 2026-04-14 Ayelet Amster , Lioz Akirav , Rica Gonen , Erel Segal-Halevi