Learning to Harvest Without Collapse in a Regenerative Commons: A Lagrangian Framework
cs.AI, cs.GT
Submitted: 2026-09-29
Updated: 2026-09-29
Sources
- Open Problems in Cooperative AI
- The Lagrangian Method for Solving Constrained Markov Games
- Is Independent Learning All You Need in the StarCraft Multi-Agent Challenge?
- Learning Reciprocity in Complex Sequential Social Dilemmas
- Multi-Agent Risks from Advanced AI
- Multi-agent Reinforcement Learning in Sequential Social Dilemmas
- Reinforcement Learning with Convex Constraints
- Optimal control policies for evolutionary dynamics with environmental feedback
- High-Dimensional Continuous Control Using Generalized Advantage Estimation
- Proximal Policy Optimization Algorithms
- The Tragedy of the Commons in Multi-Population Resource Games
Related papers
- MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction
- Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
- Agents' Last Exam
- The Clinician's Veto: Navigating Trust, Liability, and Uncertainty in Autonomous AI Prescribing
- MindHelper: Closed-Loop Embodied Mental-State Reasoning for Precision Intervention
- Incumbent Advantage: Brand Bias and Cognitive Manipulation Dynamics in LLM Recommendation Systems