The following pages link to Reasoning About Strategies (Q2946746):
Displaying 50 items.
- Synthesis with rational environments (Q314471) (← links)
- Nash equilibria in symmetric graph games with partial observation (Q528190) (← links)
- Verification of multi-agent systems with public actions against strategy logic (Q785241) (← links)
- On the semantics of strategy logic (Q894440) (← links)
- An abstraction-refinement methodology for reasoning about network games (Q1630443) (← links)
- Practical verification of multi-agent systems against \textsc{Slk} specifications (Q1641030) (← links)
- Graded modalities in strategy logic (Q1641034) (← links)
- Imperfect information in reactive modules games (Q1641035) (← links)
- Reasoning about graded strategy quantifiers (Q1706169) (← links)
- Solving parity games via priority promotion (Q1742991) (← links)
- A delayed promotion policy for parity games (Q1784960) (← links)
- Cycle detection in computation tree logic (Q1784962) (← links)
- Dependences in strategy logic (Q1987514) (← links)
- Alternating-time temporal logics with linear past (Q1989330) (← links)
- On composition of bounded-recall plans (Q2046034) (← links)
- A game-theoretic approach for the synthesis of complex systems (Q2104251) (← links)
- Verification of agent navigation in partially-known environments (Q2144175) (← links)
- A logic for conditional local strategic reasoning (Q2155205) (← links)
- Robust worst cases for parity games algorithms (Q2182730) (← links)
- Infinite-duration poorman-bidding games (Q2190378) (← links)
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games (Q2211871) (← links)
- Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol (Q2225593) (← links)
- Multi-player games with LDL goals over finite traces (Q2225596) (← links)
- Epistemic GDL: a logic for representing and reasoning about imperfect information games (Q2238622) (← links)
- Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
- Strategies, model checking and branching-time properties in Maude (Q2239275) (← links)
- Dynamic resource allocation games (Q2286736) (← links)
- Knowing-how under uncertainty (Q2289005) (← links)
- Natural strategic ability (Q2289013) (← links)
- A logic with revocable and refinable strategies (Q2346411) (← links)
- From model checking to equilibrium checking: reactive modules for rational verification (Q2407463) (← links)
- Cooperative concurrent games (Q2680769) (← links)
- Reasoning About Substructures and Games (Q2957764) (← links)
- Dependences in Strategy Logic (Q3304133) (← links)
- (Q3384167) (← links)
- (Q3384177) (← links)
- Multi-valued Verification of Strategic Ability (Q4988961) (← links)
- (Q5015276) (← links)
- The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games (Q5056367) (← links)
- Quantifying Bounds in Strategy Logic (Q5079747) (← links)
- (Q5079770) (← links)
- (Q5089038) (← links)
- (Q5111630) (← links)
- Intelligence in Strategic Games (Q5154729) (← links)
- (Q5856414) (← links)
- (Q5875381) (← links)
- Good-for-Game QPTL: An Alternating Hodges Semantics (Q5875946) (← links)
- Taming strategy logic: non-recurrent fragments (Q6077842) (← links)
- An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information (Q6098854) (← links)
- HyperATL*: A Logic for Hyperproperties in Multi-Agent Systems (Q6135762) (← links)
