A Simple Adaptive Procedure Leading to Correlated Equilibrium
From MaRDI portal
(Redirected from Publication:4530983)
Recommendations
- General procedures leading to correlated equilibria
- Simple adaptive strategies. From regret-matching to uncoupled dynamics. With the collaboration of Yakov Babichenko, Amotz Cahn, Yishay Mansour and David Schmeidler
- scientific article; zbMATH DE number 1795161
- Learning correlated equilibria in games with compact sets of strategies
- On the empirical relevance of correlated equilibrium
Cited in
(only showing first 100 items - show all)- Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners' dilemma game
- Robust correlated equilibrium: definition and computation
- Cooperation between independent market makers
- Markets, correlation, and regret-matching
- Near-optimal no-regret algorithms for zero-sum games
- Globally optimal strategy against the hedge algorithm in repeated games
- On the empirical relevance of correlated equilibrium
- Rethinking formal models of partially observable multiagent decision making
- On adaptive heuristics that converge to correlated equilibrium
- A payoff-based policy gradient method in stochastic games with long-run average payoffs
- Multi-agent reinforcement learning: a selective overview of theories and algorithms
- Approachability, regret and calibration: implications and equivalences
- scientific article; zbMATH DE number 1795161 (Why is no real title available?)
- Regret minimization in repeated matrix games with variable stage duration
- Regret-based continuous-time dynamics.
- Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity
- Regret matching with finite memory
- Correlated equilibrium in a nutshell
- On the complexity of computing sparse equilibria and lower bounds for no-regret learning in games
- On the convergence of reinforcement learning
- Computation of correlated equilibrium with global-optimal expected social welfare
- Opinion dynamics with limited information
- A dynamic graph model of strategy learning for predicting human behavior in repeated games
- Convergence results on stochastic adaptive learning
- Improving Nash by coarse correlation
- Logarithmic Query Complexity for Approximate Nash Computation in Large Games
- Correlated beliefs: predicting outcomes in \(2\times 2\) games
- Evolutionary game theory: a renaissance
- Automatically designing counterfactual regret minimization algorithms for solving imperfect-information games
- Completely uncoupled dynamics and Nash equilibria
- A general criterion and an algorithmic framework for learning in multi-agent systems
- Bounding the inefficiency of outcomes in generalized second price auctions
- A wide range no-regret theorem
- Computing equilibria: a computational complexity perspective
- If multi-agent learning is the answer, what is the question?
- Recommended play and correlated equilibria: an experimental study
- Dynamics in network interaction games
- Inverse game theory: learning utilities in succinct games
- Opinion dynamics with limited information
- Informational asymmetries and observational learning in search
- No-regret algorithms in on-line learning, games and convex optimization
- Simple uncoupled no-regret learning dynamics for extensive-form correlated equilibrium
- Normative conspiracy theory
- Stochastic uncoupled dynamics and Nash equilibrium
- How long to equilibrium? The communication complexity of uncoupled equilibrium procedures
- Learning by trial and error
- The possible and the impossible in multi-agent learning
- Correlated equilibrium in evolutionary models with subpopulations
- Learning in Games
- Approachability with bounded memory
- Payoff performance of fictitious play
- Replicator dynamics: old and new
- The importance of memory for price discovery in decentralized markets
- NEWTONIAN MECHANICS AND NASH PLAY
- scientific article; zbMATH DE number 6866347 (Why is no real title available?)
- Correlated Equilibria in Wireless Power Control Games
- Heterogeneous beliefs and local information in stochastic fictitious play
- The query complexity of correlated equilibria
- Logarithmic query complexity for approximate Nash computation in large games
- Repeated games with incomplete information
- Networks of biosensors: decentralized activation and social learning
- A natural adaptive process for collective decision-making
- Adaptive Heuristics
- Opinion dynamics and learning in social networks
- AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents
- Characterizing stability properties in games with strategic substitutes
- Pretending in dynamic games, alternative outcomes and application to electricity markets
- On learning algorithms for Nash equilibria
- Robust option pricing: Hannan and Blackwell meet Black and Scholes
- The performance profile: a multi-criteria performance evaluation method for test-based problems
- Algorithms for computing strategies in two-player simultaneous move games
- A general class of adaptive strategies
- Simple adaptive strategies. From regret-matching to uncoupled dynamics. With the collaboration of Yakov Babichenko, Amotz Cahn, Yishay Mansour and David Schmeidler
- Exponential weight algorithm in continuous time
- Introducing disappointment dynamics and comparing behaviors in evolutionary games: some simulation results
- Learning in games with unstable equilibria
- Correlated equilibria in homogeneous good Bertrand competition
- Strong robustness to incomplete information and the uniqueness of a correlated equilibrium
- Implementation in adaptive better-response dynamics: towards a general theory of bounded rationality in mechanisms
- Belief-based equilibrium
- Learning correlated equilibria in games with compact sets of strategies
- A general internal regret-free strategy
- Rule rationality
- Smooth calibration, leaky forecasts, finite recall, and Nash dynamics
- Penalty-regulated dynamics and robust learning procedures in games
- Calibrated learning and correlated equilibrium
- Learning in network contexts: experimental results from simulations
- Playing against no-regret players
- General procedures leading to correlated equilibria
- (A)symmetric equilibria and adaptive learning dynamics in small-committee voting
- Evidence for learning to learn behavior in normal form games
- A myopic adjustment process leading to best-reply matching.
- Deterministic calibration and Nash equilibrium
- Pseudonorm approachability and applications to regret minimization
- Learning, hypothesis testing, and Nash equilibrium.
- Correlated equilibria and communication in games
- An evolutionary approach to learning in a changing environment.
- Learning in games with cumulative prospect theoretic preferences
- Provably efficient reinforcement learning in decentralized general-sum Markov games
- The price of anarchy of strategic queuing systems
This page was built for publication: A Simple Adaptive Procedure Leading to Correlated Equilibrium
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530983)
