Equilibria for games with combined qualitative and quantitative objectives
From MaRDI portal
Publication:824280
DOI10.1007/s00236-020-00385-4zbMath1483.68193arXiv2008.05643OpenAlexW3034407568MaRDI QIDQ824280
Aniello Murano, Giuseppe Perelli, Julian Gutierrez, Thomas Steeples, Michael Wooldridge, Sasha Rubin
Publication date: 15 December 2021
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.05643
Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Agent technology and artificial intelligence (68T42)
Related Items (2)
Mean-payoff games with \(\omega\)-regular specifications ⋮ Incentive Engineering for Concurrent Games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Synthesis with rational environments
- Incentive engineering for Boolean games
- On total functions, existence theorems and computational complexity
- Understanding and using linear programming
- Strategy logic
- Positional strategies for mean payoff games
- The complexity of mean payoff games on graphs
- The complexity of decision problems about equilibria in two-player Boolean games
- Energy parity games
- The complexity of multi-mean-payoff and multi-energy games
- Iterated Boolean games
- Model-checking for resource-bounded ATL with production and consumption of resources
- From model checking to equilibrium checking: reactive modules for rational verification
- On the complexity of planning for agent teams and its implications for single agent planning
- Temporal Logics in Computer Science
- Pure Nash Equilibria in Concurrent Deterministic Games
- The Complexity of Nash Equilibria in Limit-Average Games
- Alternating-time temporal logic
- Rational Synthesis
- Multiagent Systems
- Better Quality in Synthesis through Quantitative Objectives
- Secure equilibria in weighted games
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Equilibria for games with combined qualitative and quantitative objectives