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)- Learning by trial and error
- If multi-agent learning is the answer, what is the question?
- Perspectives on multiagent learning
- The possible and the impossible in multi-agent learning
- On stable social laws and qualitative equilibria
- Calibrated learning and correlated equilibrium
- Predicting a binary sequence almost as well as the optimal biased coin
- Learning, hypothesis testing, and Nash equilibrium.
- Regret-based continuous-time dynamics.
- An evolutionary approach to learning in a changing environment.
- The query complexity of correlated equilibria
- Approachability of convex sets in generalized quitting games
- Evolutionary game theory: a renaissance
- Two ``little treasure games driven by unconditional regret
- Evolutionary network games: equilibria from imitation and best response dynamics
- Selecting efficient correlated equilibria through distributed learning
- Correlated equilibrium in a nutshell
- Randomized prediction of individual sequences
- Logarithmic query complexity for approximate Nash computation in large games
- Pretending in dynamic games, alternative outcomes and application to electricity markets
- Learning to play efficient coarse correlated equilibria
- Smooth calibration, leaky forecasts, finite recall, and Nash dynamics
- General procedures leading to correlated equilibria
- Evidence for learning to learn behavior in normal form games
- On the convergence of reinforcement learning
- A wide range no-regret theorem
- Special issue: Learning in games: a symposium in honor of David Blackwell.
- Regret in the on-line decision problem
- A proof of calibration via Blackwell's approachability theorem.
- Adaptive game playing using multiplicative weights
- Conditional universal consistency.
- A myopic adjustment process leading to best-reply matching.
- Consistent collusion-proofness and correlation in exchange economies.
- Belief-based equilibrium
- Dynamics in network interaction games
- The importance of memory for price discovery in decentralized markets
- Normative conspiracy theory
- Multi-agent reinforcement learning: a selective overview of theories and algorithms
- On the empirical relevance of correlated equilibrium
- Strong robustness to incomplete information and the uniqueness of a correlated equilibrium
- A semi-potential for finite and infinite games in extensive form
- Constrained no-regret learning
- On adaptive heuristics that converge to correlated equilibrium
- Opinion dynamics with limited information
- Correlated beliefs: predicting outcomes in \(2\times 2\) games
- Local smoothness and the price of anarchy in splittable congestion games
- Bounding the inefficiency of outcomes in generalized second price auctions
- Learning in games with unstable equilibria
- A distributed algorithm to obtain repeated games equilibria with discounting
- Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games
- Convergence results on stochastic adaptive learning
- Introducing disappointment dynamics and comparing behaviors in evolutionary games: some simulation results
- Correlated equilibria in homogeneous good Bertrand competition
- Learning correlated equilibria in games with compact sets of strategies
- AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents
- A general criterion and an algorithmic framework for learning in multi-agent systems
- Approachability with bounded memory
- Dynamic benchmark targeting
- Reinforcement learning in population games
- Approachability, regret and calibration: implications and equivalences
- Improving Nash by coarse correlation
- Deterministic calibration and Nash equilibrium
- Correlated equilibrium in evolutionary models with subpopulations
- Near-optimal no-regret algorithms for zero-sum games
- Learning to play games in extensive form by valuation
- Payoff performance of fictitious play
- Recommended play and correlated equilibria: an experimental study
- Rethinking formal models of partially observable multiagent decision making
- A dynamic graph model of strategy learning for predicting human behavior in repeated games
- Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners' dilemma game
- Robust option pricing: Hannan and Blackwell meet Black and Scholes
- Rule rationality
- Logarithmic Query Complexity for Approximate Nash Computation in Large Games
- Online discrete optimization in social networks in the presence of Knightian uncertainty
- Learning in games via reinforcement and regularization
- An adjusted payoff-based procedure for normal form games
- Learning correlated equilibria in noncooperative games with cluster structure
- The performance profile: a multi-criteria performance evaluation method for test-based problems
- Algorithms for computing strategies in two-player simultaneous move games
- Simple adaptive strategies. From regret-matching to uncoupled dynamics. With the collaboration of Yakov Babichenko, Amotz Cahn, Yishay Mansour and David Schmeidler
- A general internal regret-free strategy
- On learning algorithms for Nash equilibria
- Normative conspiracy theory
- Information diffusion in social sensing
- Penalty-regulated dynamics and robust learning procedures in games
- Inverse game theory: learning utilities in succinct games
- Efficient Correlated Action Selection
- Calibration and internal no-regret with random signals
- Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity
- Regret matching with finite memory
- Completely uncoupled dynamics and Nash equilibria
- Computation of correlated equilibrium with global-optimal expected social welfare
- Characterizing stability properties in games with strategic substitutes
- scientific article; zbMATH DE number 1795161 (Why is no real title available?)
- Correlated Equilibria in Wireless Power Control Games
- Learning equilibria of a stochastic game on Gaussian interference channels with incomplete information
- scientific article; zbMATH DE number 6866347 (Why is no real title available?)
- NEWTONIAN MECHANICS AND NASH PLAY
- Strong approachability
- Markets, correlation, and regret-matching
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)