Research map / Bandits and online learning / RL theory and MDPs
Learning in Non-Cooperative Configurable Markov Decision Processes
Giorgia Ramponi, Alberto Maria Metelli, Alessandro Concetti, Marcello Restelli
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use AfOCL (plausible-action optimism) instead of UCB1 | configurator learning · Configurable Gridworld (M=10, 30) | cumulative regret | Improved |
| add noisy agent-reward feedback (RfOCL instead of AfOCL) | AfOCL · Configurable Gridworld (M=10, 30) | cumulative regret | Improved |
| violate Assumption 1 with non-ergodic deterministic optimal policies | RfOCL vs AfOCL · Gridworld without ergodicity (3 configurations) | cumulative regret | No clear effect |
| use AfOCL and RfOCL instead of UCB1 in non-ergodic setting | UCB1-tuned · Gridworld without ergodicity | cumulative regret | Improved |
| use AfOCL and RfOCL instead of UCB1 | UCB1 · Student-Teacher (M=40, 60, 100) | cumulative regret | Improved |
| increase number of configurations M from 40 to 100 | RfOCL relative to AfOCL · Student-Teacher | cumulative regret gap | Improved |
Closest papers by meaning
- Online Markov Decision Processes Configuration with Continuous Decision Space (AAAI 2024 · similarity 0.91)
- Efficient Reinforcement Learning in Probabilistic Reward Machines (AAAI 2025 · similarity 0.88)
- Efficient Exploration in Average-Reward Constrained Reinforcement Learning: Achieving Near-Optimal Regret With Posterior Sampling (ICML 2024 · similarity 0.87)
- Online Episodic Convex Reinforcement Learning (ICML 2025 · similarity 0.87)
- Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithms (NeurIPS 2024 · similarity 0.87)
- Policy-Regret Minimization in Markov Games with Function Approximation (ICML 2025 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
