Playing against a stationary opponent
Fuente:
arXiv
Guardado en:
| Autores principales: | Grand-Clément, Julien, Vieille, Nicolas |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Beyond discounted returns: Robust Markov decision processes with average and Blackwell optimality
por: Grand-Clément, Julien, et al.
Publicado: (2023)
por: Grand-Clément, Julien, et al.
Publicado: (2023)
Connectivity in the presence of an opponent
por: Liang, Zihui, et al.
Publicado: (2023)
por: Liang, Zihui, et al.
Publicado: (2023)
Extensive-Form Game Solving via Blackwell Approachability on Treeplexes
por: Chakrabarti, Darshan, et al.
Publicado: (2024)
por: Chakrabarti, Darshan, et al.
Publicado: (2024)
Thresholds for sensitive optimality and Blackwell optimality in stochastic games
por: Gaubert, Stéphane, et al.
Publicado: (2025)
por: Gaubert, Stéphane, et al.
Publicado: (2025)
Dynamic Programming for Epistemic Uncertainty in Markov Decision Processes
por: Benyamine, Axel, et al.
Publicado: (2026)
por: Benyamine, Axel, et al.
Publicado: (2026)
Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games
por: Cai, Yang, et al.
Publicado: (2023)
por: Cai, Yang, et al.
Publicado: (2023)
Strategic Experimentation with Private Payoffs
por: Renault, Jérôme, et al.
Publicado: (2025)
por: Renault, Jérôme, et al.
Publicado: (2025)
An impossibility result for strongly group-strategyproof multi-winner approval-based voting
por: Caragiannis, Ioannis, et al.
Publicado: (2024)
por: Caragiannis, Ioannis, et al.
Publicado: (2024)
On Separation Between Best-Iterate, Random-Iterate, and Last-Iterate Convergence of Learning in Games
por: Cai, Yang, et al.
Publicado: (2025)
por: Cai, Yang, et al.
Publicado: (2025)
Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms
por: Cai, Yang, et al.
Publicado: (2024)
por: Cai, Yang, et al.
Publicado: (2024)
Contracting With a Reinforcement Learning Agent by Playing Trick or Treat
por: Bollini, Matteo, et al.
Publicado: (2024)
por: Bollini, Matteo, et al.
Publicado: (2024)
Zero-Sum Fictitious Play Cannot Converge to a Point
por: Moon, Jaehong
Publicado: (2026)
por: Moon, Jaehong
Publicado: (2026)
Tie-breaking Agnostic Lower Bound for Fictitious Play
por: Wang, Yuanhao
Publicado: (2025)
por: Wang, Yuanhao
Publicado: (2025)
Playing Stochastically in Weighted Timed Games to Emulate Memory
por: Monmege, Benjamin, et al.
Publicado: (2021)
por: Monmege, Benjamin, et al.
Publicado: (2021)
Playing with Peaks: A Game-Theoretic Comparison of Electricity Pricing Mechanisms
por: Shah, Vade, et al.
Publicado: (2025)
por: Shah, Vade, et al.
Publicado: (2025)
Let Leaders Play Games: Improving Timing in Leader-based Consensus
por: M, Rasheed, et al.
Publicado: (2026)
por: M, Rasheed, et al.
Publicado: (2026)
Self-Play Q-learners Can Provably Collude in the Iterated Prisoner's Dilemma
por: Bertrand, Quentin, et al.
Publicado: (2023)
por: Bertrand, Quentin, et al.
Publicado: (2023)
Team-Fictitious Play for Reaching Team-Nash Equilibrium in Multi-team Games
por: Donmez, Ahmed Said, et al.
Publicado: (2024)
por: Donmez, Ahmed Said, et al.
Publicado: (2024)
Beyond Nash Equilibrium: Achieving Bayesian Perfect Equilibrium with Belief Update Fictitious Play
por: Ju, Qi, et al.
Publicado: (2024)
por: Ju, Qi, et al.
Publicado: (2024)
Can a Weaker Player Win? Adaptive Play in Repeated Games
por: ANSELMI, Jonatha, et al.
Publicado: (2026)
por: ANSELMI, Jonatha, et al.
Publicado: (2026)
From First-Order to Second-Order Rationality: Advancing Game Convergence with Dynamic Weighted Fictitious Play
por: Ju, Qi, et al.
Publicado: (2024)
por: Ju, Qi, et al.
Publicado: (2024)
Responding to Promises: No-regret learning against followers with memory
por: Hebbar, Vijeth, et al.
Publicado: (2024)
por: Hebbar, Vijeth, et al.
Publicado: (2024)
Learning to Play Against Unknown Opponents
por: Arunachaleswaran, Eshwar Ram, et al.
Publicado: (2024)
por: Arunachaleswaran, Eshwar Ram, et al.
Publicado: (2024)
Natural Language Mechanisms via Self-Resolution with Foundation Models
por: Della Penna, Nicolas
Publicado: (2024)
por: Della Penna, Nicolas
Publicado: (2024)
NFT Games: an Empirical Look into the Play-to-Earn Model
por: Gao, Yixiao, et al.
Publicado: (2026)
por: Gao, Yixiao, et al.
Publicado: (2026)
Playing Markov Games Without Observing Payoffs
por: Ablin, Daniel, et al.
Publicado: (2025)
por: Ablin, Daniel, et al.
Publicado: (2025)
Meta-Learning in Self-Play Regret Minimization
por: Sychrovský, David, et al.
Publicado: (2025)
por: Sychrovský, David, et al.
Publicado: (2025)
On the Variational Interpretation of Mirror Play in Monotone Games
por: Pan, Yunian, et al.
Publicado: (2024)
por: Pan, Yunian, et al.
Publicado: (2024)
Safe Exploitative Play with Untrusted Type Beliefs
por: Li, Tongxin, et al.
Publicado: (2024)
por: Li, Tongxin, et al.
Publicado: (2024)
Playing Divide-and-Choose Given Uncertain Preferences
por: Tucker-Foltz, Jamie, et al.
Publicado: (2022)
por: Tucker-Foltz, Jamie, et al.
Publicado: (2022)
Playing Large Games with Oracles and AI Debate
por: Chen, Xinyi, et al.
Publicado: (2023)
por: Chen, Xinyi, et al.
Publicado: (2023)
Is Limited Information Enough? An Approximate Multi-agent Coverage Control in Non-Convex Discrete Environments
por: Iwase, Tatsuya, et al.
Publicado: (2024)
por: Iwase, Tatsuya, et al.
Publicado: (2024)
Online Housing Market
por: Lesca, Julien
Publicado: (2025)
por: Lesca, Julien
Publicado: (2025)
Fictitious Play in Extensive-Form Games of Imperfect Information
por: Castiglione, Jason, et al.
Publicado: (2025)
por: Castiglione, Jason, et al.
Publicado: (2025)
Playing games with Large language models: Randomness and strategy
por: Vidler, Alicia, et al.
Publicado: (2025)
por: Vidler, Alicia, et al.
Publicado: (2025)
Multi-District School Choice: Playing on Several Fields
por: Gonczarowski, Yannai A., et al.
Publicado: (2024)
por: Gonczarowski, Yannai A., et al.
Publicado: (2024)
Cities at Play: Improving Equilibria in Urban Neighbourhood Games
por: Gairing, Martin, et al.
Publicado: (2026)
por: Gairing, Martin, et al.
Publicado: (2026)
Playing Safe, Ten Years Later
por: Colcombet, Thomas, et al.
Publicado: (2022)
por: Colcombet, Thomas, et al.
Publicado: (2022)
On Nash Equilibria in Play-Once and Terminal Deterministic Graphical Games
por: Boros, Endre, et al.
Publicado: (2025)
por: Boros, Endre, et al.
Publicado: (2025)
Safe Pareto Improvements for Expected Utility Maximizers in Program Games
por: DiGiovanni, Anthony, et al.
Publicado: (2024)
por: DiGiovanni, Anthony, et al.
Publicado: (2024)
Ejemplares similares
-
Beyond discounted returns: Robust Markov decision processes with average and Blackwell optimality
por: Grand-Clément, Julien, et al.
Publicado: (2023) -
Connectivity in the presence of an opponent
por: Liang, Zihui, et al.
Publicado: (2023) -
Extensive-Form Game Solving via Blackwell Approachability on Treeplexes
por: Chakrabarti, Darshan, et al.
Publicado: (2024) -
Thresholds for sensitive optimality and Blackwell optimality in stochastic games
por: Gaubert, Stéphane, et al.
Publicado: (2025) -
Dynamic Programming for Epistemic Uncertainty in Markov Decision Processes
por: Benyamine, Axel, et al.
Publicado: (2026)