中文
相关论文

相关论文: Lower Bounds on Implementing Robust and Resilient …

200 篇论文

We study a game of strategic information design between a sender, who chooses state-dependent information structures, a mediator who can then garble the signals generated from these structures, and a receiver who takes an action after…

理论经济学 · 经济学 2020-12-07 Andrew Kosenko

In this paper, we study cooperation in distributed games under network-constrained communication. Building on the framework of Monderer and Tennenholtz (1999), we derive a sufficient condition for cooperative equilibrium in settings where…

计算机科学与博弈论 · 计算机科学 2025-11-10 Tommy Mordo , Omer Madmon , Moshe Tennenholtz

Experiments on the ultimatum game have revealed that humans are remarkably fond of fair play. When asked to share an amount of money, unfair offers are rare and their acceptance rate small. While empathy and spatiality may lead to the…

物理与社会 · 物理学 2012-08-20 Attila Szolnoki , Matjaz Perc , Gyorgy Szabo

The \((n,k)\) game models a group of \(n\) individuals with binary opinions, say 1 and 0, where a decision is made if at least \(k\) individuals hold opinion 1. This paper explores the dynamics of the game with heterogeneous agents under…

概率论 · 数学 2024-09-17 Hsin-Lun Li

Knockout tournaments, also known as single-elimination or cup tournaments, are a popular form of sports competitions. In the standard probabilistic setting, for each pairing of players, one of the players wins the game with a certain (a…

数据结构与算法 · 计算机科学 2024-12-17 Juhi Chaudhary , Hendrik Molter , Meirav Zehavi

In this paper we introduce the novel framework of distributionally robust games. These are multi-player games where each player models the state of nature using a worst-case distribution, also called adversarial distribution. Thus each…

最优化与控制 · 数学 2017-07-25 Dario Bauso , Jian Gao , Hamidou Tembine

We consider an optimal partition of resources (e.g. consumers) between several agents (e.g. experts), given utility functions ("wisdoms") for the agents and their capacities. This problem is a variant of optimal transport…

最优化与控制 · 数学 2016-04-07 Gershon Wolansky

This paper studies the problem of intervention design for steering the actions of noncooperative players in quadratic network games to the social optimum. The players choose their actions with the aim of maximizing their individual payoff…

最优化与控制 · 数学 2024-06-17 Mehran Shakarami , Ashish Cherukuri , Nima Monshizadeh

We study the problem of resilient strategies in the presence of uncertainty. Resilient strategies enable an agent to make decisions that are robust against disturbances. In particular, we are interested in those disturbances that are able…

计算机科学与博弈论 · 计算机科学 2026-03-02 Kush Grover , Markel Zubia , Debraj Chakraborty , Muqsit Azeem , Nils Jansen , Jan Kretinsky

This paper discusses a special type of multi-user communication scenario, in which users' utilities are linearly impacted by their competitors' actions. First, we explicitly characterize the Nash equilibrium and Pareto boundary of the…

计算机科学与博弈论 · 计算机科学 2009-08-13 Yi Su , Mihaela van der Schaar

We study N-player finite games with costs perturbed due to time-varying disturbances in the underlying system and to that end, we propose the concept of Robust Correlated Equilibrium that generalizes the definition of Correlated…

系统与控制 · 电气工程与系统科学 2025-07-02 Rahul Misra , Rafał Wisniewski , Carsten Skovmose Kallesøe , Manuela L. Bujorianu

The behaviour of multi-agent learning in many player games has been shown to display complex dynamics outside of restrictive examples such as network zero-sum games. In addition, it has been shown that convergent behaviour is less likely to…

计算机科学与博弈论 · 计算机科学 2023-07-27 Aamal Hussain , Dan Leonte , Francesco Belardinelli , Georgios Piliouras

We consider a multi-player non-zero-sum turn-based game (abbreviated as multi-player game) on a finite directed graph. A secure equilibrium (SE) is a strategy profile in which no player has the incentive to deviate from the strategy because…

计算机科学与博弈论 · 计算机科学 2025-09-03 Hiroki Mizuno , Yoshiaki Takata , Hiroyuki Seki

We consider a network of coupled agents playing the Prisoner's Dilemma game, in which players are allowed to pick a strategy in the interval [0,1], with 0 corresponding to defection, 1 to cooperation, and intermediate values representing…

适应与自组织系统 · 物理学 2015-05-28 Francesco Sorrentino , Nicholas Mecholsky

One of the contributions of this work is to formulate the problem of energy-efficient power control in multiple access channels (namely, channels which comprise several transmitters and one receiver) as a stochastic differential game. The…

网络与互联网体系结构 · 计算机科学 2013-05-14 François Mériaux , Samson Lasaulce , Hamidou Tembine

Is there an equilibrium for distributed consensus when all agents except one collude to steer the decision value towards their preference? If an equilibrium exists, then an $n-1$ size coalition cannot do better by deviating from the…

分布式、并行与集群计算 · 计算机科学 2019-09-10 Yehuda Afek , Itay Harel , Amit Jacob-Fanani , Moshe Sulamy

This paper studies a communication game between an uninformed decision maker and two perfectly informed senders with conflicting interests. Senders can misreport information at a cost that increases with the size of the misrepresentation.…

理论经济学 · 经济学 2023-04-17 Federico Vaccari

The literature on strategic communication originated with the influential cheap talk model, which precedes the Bayesian persuasion model by three decades. This model describes an interaction between two agents: sender and receiver. The…

计算机科学与博弈论 · 计算机科学 2024-09-11 Yakov Babichenko , Inbal Talgam-Cohen , Haifeng Xu , Konstantin Zabarnyi

Wealthy individuals may be less tempted to defect than those with comparatively low payoffs. To take this into consideration, we introduce coevolutionary success-driven multigames in structured populations. While the core game is always the…

物理与社会 · 物理学 2014-10-17 Attila Szolnoki , Matjaz Perc

We prove an $N^{2-o(1)}$ lower bound on the randomized communication complexity of finding an $\epsilon$-approximate Nash equilibrium (for constant $\epsilon>0$) in a two-player $N\times N$ game.

计算复杂性 · 计算机科学 2018-05-17 Mika Göös , Aviad Rubinstein