scientific article

zbMath1214.91003MaRDI QIDQ3083813

No author found.

Publication date: 23 March 2011

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to game theory, economics, and finance (91-06) Mathematics for nonmathematicians (engineering, social sciences, etc.) (00A06) Game theory (91Axx)

Related Items (31)

Simplifying optimal strategies in \(\limsup\) and \(\liminf\) stochastic games ⋮ On refinements of subgame perfect \(\epsilon\)-equilibrium ⋮ The fixed initial credit problem for partial-observation energy games is \textsc{Ack}-complete ⋮ A Rough View on Incomplete Information in Games ⋮ Optimal supervisory control with mean payoff objectives and under partial observation ⋮ Bidding mechanisms in graph games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus ⋮ Robust worst cases for parity games algorithms ⋮ Infinite-duration poorman-bidding games ⋮ Universal algorithms for parity games and nested fixpoints ⋮ Unnamed Item ⋮ Enforcing opacity by insertion functions under multiple energy constraints ⋮ Constrained existence of weak subgame perfect equilibria in multiplayer Büchi games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Game-based Synthesis of Distributed Controllers for Sampled Switched Systems ⋮ The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs ⋮ Solving parity games via priority promotion ⋮ Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints ⋮ Unnamed Item ⋮ A delayed promotion policy for parity games ⋮ Games for Inclusion Logic and Fixed-Point Logic ⋮ A Survey of Bidding Games on Graphs (Invited Paper) ⋮ Some game-theoretic remarks on two-player generalized cops and robbers games ⋮ Unnamed Item ⋮ Infinite-Duration Bidding Games ⋮ Uniform strategies, rational relations and jumping automata ⋮ Reasoning about memoryless strategies under partial observability and unconditional fairness constraints ⋮ A classification of weakly acyclic games

This page was built for publication: