Convergence analysis of iterated best response for a trusted computation game

DOI10.1016/J.AUTOMATICA.2016.11.046zbMath1357.93064arXiv1611.02329OpenAlexW2556464320MaRDI QIDQ518294

Cédric Langbort, Alberto Speranzon, Shaunak D. Bopardikar

Publication date: 28 March 2017

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.02329

zbMATH Keywords

game theorycomputational methodsadversarial machine learningiterated best response

Mathematics Subject Classification ID

Noncooperative games (91A10) Learning and adaptive systems in artificial intelligence (68T05) 2-person games (91A05) Control/observation systems involving computers (process control, etc.) (93C83)

Related Items (3)

Characterizing oscillations in heterogeneous populations of coordinators and anticoordinators ⋮ Convergence analysis of iterated best response for a trusted computation game ⋮ Equilibrium analysis and incentive-based control of the anticoordinating networked game dynamics

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence analysis of iterated best response for a trusted computation game
• A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality
• An iterative method of solving a game
• Adversarial Machine Learning
• Fast computation of low-rank matrix approximations
• Joint Strategy Fictitious Play With Inertia for Potential Games
• Unified Convergence Proofs of Continuous-Time Fictitious Play
• Dynamic fictitious play, dynamic gradient play, and distributed convergence to Nash equilibria

This page was built for publication: Convergence analysis of iterated best response for a trusted computation game