Controlling a population
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Agent technology and artificial intelligence (68T42) Applications of game theory (91A80) Multi-agent systems (93A16)
Recommendations
Cites work
- Algebras and combinators
- Hilbert's Twenty-Fourth Problem
- scientific article; zbMATH DE number 2186305 (Why is no real title available?)
- scientific article; zbMATH DE number 3719108 (Why is no real title available?)
- scientific article; zbMATH DE number 5219795 (Why is no real title available?)
- Lambda terms for natural deduction, sequent calculus and cut elimination
- The Last Mathematician from Hilbert's Göttingen: Saunders Mac Lane as Philosopher of Mathematics
Cited in
(8)- Controlling a random population
- Integral control for population management
- Controlling a random population
- scientific article; zbMATH DE number 7559502 (Why is no real title available?)
- Controlling a population
- Synthesis of distributed agreement-based systems with efficiently-decidable verification
- Synthesizing safe coalition strategies
- Coverage games
This page was built for publication: Controlling a population
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227518)