Game Theory with Simulation in the Presence of Unpredictable Randomisation
AI agents will be predictable in certain ways that traditional agents are not. Where and how can we leverage this predictability in order to improve social welfare? We study this question in a game-theoretic setting where one agent can pay a fixed cost to simulate the other in order to learn its mixed strategy. As a negative result, we prove that, in contrast to prior work on pure-strategy simulation, enabling mixed-strategy simulation may no longer lead to improved outcomes for both players in all so-called "generalised trust games". In fact, mixed-strategy simulation does not help in any game where the simulatee's action can depend on that of the simulator. We also show that, in general, deciding whether simulation introduces Pareto-improving Nash equilibria in a given game is NP-hard. As positive results, we establish that mixed-strategy simulation can improve social welfare if the simulator has the option to scale their level of trust, if the players face challenges with both trust and coordination, or if maintaining some level of privacy is essential for enabling cooperation.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
BehAVE: Behaviour Alignment of Video Game Encodings
Domain randomisation enhances the transferability of vision models across visually distinct domains with similar content. However, current methods heavily depend on intricate simulation engines, hampering feasibility and…
DiversityFPS GamesVideo UnderstandingAnalysing Deep Reinforcement Learning Agents Trained with Domain Randomisation
Deep reinforcement learning has the potential to train robots to perform complex tasks in the real world without requiring accurate models of the robot or its environment. A practical approach is to train agents in simul…
Deep Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)On the importance of block randomisation when designing proteomics experiments
Randomisation is used in experimental design to reduce the prevalence of unanticipated confounders. Complete randomisation can however create unbalanced designs, for example, grouping all samples of the same condition in…
BlockingExperimental DesignChaos persists in large-scale multi-agent learning despite adaptive learning rates
Multi-agent learning is intrinsically harder, more unstable and unpredictable than single agent optimization. For this reason, numerous specialized heuristics and techniques have been designed towards the goal of achievi…
Understanding Emergent Behaviours in Multi-Agent Systems with Evolutionary Game Theory
The mechanisms of emergence and evolution of collective behaviours in dynamical Multi-Agent Systems (MAS) of multiple interacting agents, with diverse behavioral strategies in co-presence, have been undergoing mathematic…