A robust saturated strategy for n-player prisoner's dilemma
From MaRDI portal
(Redirected from Publication:4685372)
A robust saturated strategy for \(n\)-player prisoner's dilemma
A robust saturated strategy for \(n\)-player prisoner's dilemma
Recommendations
Cites work
- A general class of adaptive strategies
- A Robust Decentralized Control for Channel Sharing Communication
- A wide range no-regret theorem
- Adaptive Heuristics
- Allocation processes in cooperative games
- An analog of the minimax theorem for vector payoffs
- Approachability in infinite dimensional spaces
- Asymptotic pseudotrajectories and chain recurrent flows, with applications
- Attainability in repeated games with vector payoffs
- Axiomatic approach in differential games
- Continuous Time Repeated Games
- Continuous-time stochastic games
- Evolution of extortion in iterated prisoner's dilemma games
- Evolutionary performance of zero-determinant strategies in multiplayer games
- Excludability and Bounded Computational Capacity
- Game Theory in Wireless and Communication Networks
- GLAD: a simple adaptive strategy that yields cooperation in dilemma games
- scientific article; zbMATH DE number 5869530 (Why is no real title available?)
- scientific article; zbMATH DE number 3855514 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 1516499 (Why is no real title available?)
- scientific article; zbMATH DE number 5176447 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- Objective function design for robust optimality of linear control under state-constraints and uncertainty
- On the Existence of Solutions to a Differential Game
- Partners or rivals? Strategies for the iterated prisoner's dilemma
- Prediction, Learning, and Games
- Prospect Theory: An Analysis of Decision under Risk
- Regret in the on-line decision problem
- Regret-based continuous-time dynamics.
- Repeated games and qualitative differential games: approachability and comparison of strategies
- Repeated games with incomplete information. With the collaboration of Richard E. Stearns
- Set invariance in control
- Set-theoretic methods in control
- Set-valued analysis
- Smale strategies for network prisoner's dilemma games
- Stochastic Approximations and Differential Inclusions
- The existence of value in differential games of pursuit and evasion
- The Prisoner's Dilemma and Dynamical Systems Associated to Non-Cooperative Games
- Viability theory
- Weak Approachability
Cited in
(5)- A robust folk theorem for the prisoner's dilemma
- Cooperative n-person Prisoner's Dilemma on a Network
- The impact of irrational behaviors in the optional prisoner's dilemma with game‐environment feedback
- \(q\)-strategy spatial prisoner's dilemma game
- A successful strategy for iterated prisoner's dilemma with any number of channels
This page was built for publication: A robust saturated strategy for \(n\)-player prisoner's dilemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4685372)
