Verifying team formation protocols with probabilistic model checking
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Agent technology and artificial intelligence (68T42) Markov and semi-Markov decision processes (90C40) Stochastic games, stochastic differential games (91A15)
- scientific article; zbMATH DE number 1973984 (Why is no real title available?)
- A course in game theory.
- A logic for reasoning about time and reliability
- Alternating-time temporal logic
- Efficient coalitions in Boolean games
- Methods for task allocation via agent coalition formation
- Quantitative multi-objective verification for probabilistic systems
- Reasoning about coalitional games
- Stochastic model checking
- Strategy Logic
- The complexity of stochastic games
- A counter abstraction technique for verifying properties of probabilistic swarm systems
- Simple strategies in multi-objective MDPs
- Value iteration for simple stochastic games: stopping criterion and learning algorithm
- Stochastic equilibria under imprecise deviations in terminal-reward concurrent games
- Automatic verification of competitive stochastic systems
- Counter abstraction for regular open teams
This page was built for publication: Verifying team formation protocols with probabilistic model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092303)
