Energy and Mean-Payoff Games with Imperfect Information

DOI10.1007/978-3-642-15205-4_22zbMath1287.91028OpenAlexW1829319030MaRDI QIDQ3586046

Szymon Toruńczyk, Aldric Degorre, Laurent Doyen, Jean-François Raskin, Raffaella Gentilini

Publication date: 3 September 2010

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15205-4_22

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Looking at mean payoff through foggy windows ⋮ Minimum Attention Controller Synthesis for Omega-Regular Objectives ⋮ Mean-payoff games with partial observation ⋮ The fixed initial credit problem for partial-observation energy games is \textsc{Ack}-complete ⋮ Reachability games with relaxed energy constraints ⋮ On the comparison of discounted-sum automata with multiple discount factors ⋮ Unnamed Item ⋮ Enforcing opacity by insertion functions under multiple energy constraints ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reactive synthesis without regret ⋮ Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games ⋮ Unnamed Item ⋮ What's decidable about weighted automata? ⋮ Energy Games in Multiweighted Automata ⋮ Optimal Bounds for Multiweighted and Parametrised Energy Games

This page was built for publication: Energy and Mean-Payoff Games with Imperfect Information