DigitalCommons@USU
metadata only
A Provable Semi-Infinite Programming Approach for Solving Constrained Dynamic Games
Many engineering problems must account for the non-cooperative decisions and actions of multiple players. These problems can be modeled within a game-theoretic framework. The approach herein is to model such problems as mathematical games, convert them to semi-infinite programs, and utilize a semi-i
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An extensible autonomous search framework for constraint programming#947555
- A posteriori probabilistic feasibility guarantees for Nash equilibria in uncertain multi-agent games#1000426
- Introduction to Mathematical Programming#3612
- Introduction: Formal approaches to multi-agent systems: Special issue of best papers of FAMAS 2007#721460
- Solving Robust POMDPs with Omega-regular Objectives via Partially Observable Stochastic Games#1141632
Record · ID 814155
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive