On the complexity of heterogeneous multidimensional quantitative games
From MaRDI portal
Publication:4608663
DOI10.4230/LIPIcs.CONCUR.2016.11zbMath1392.68198OpenAlexW2963953509MaRDI QIDQ4608663
Quentin Hautem, Véronique Bruyère, Jean-François Raskin
Publication date: 21 March 2018
Full work available at URL: https://dblp.uni-trier.de/db/conf/concur/concur2016.html#BruyereHR16
quantitative objectivesmultidimensional heterogeneous objectivestwo-player zero-sum games played on graphs
Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Signed and weighted graphs (05C22)
Related Items (6)
Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Stackelberg-Pareto synthesis ⋮ Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions ⋮ Timed games with bounded window parity objectives
This page was built for publication: On the complexity of heterogeneous multidimensional quantitative games
