The following pages link to Games with secure equilibria (Q854165):
Displaying 42 items.
- Equilibrium contained by counter-threats and complex equilibrium in secure strategies (Q334226) (← links)
- Network-formation games with regular objectives (Q342715) (← links)
- Better reply security and existence of equilibria in differential games (Q384051) (← links)
- Assume-admissible synthesis (Q520340) (← links)
- Nash equilibria in symmetric graph games with partial observation (Q528190) (← links)
- Doomsday equilibria for omega-regular games (Q528193) (← links)
- Assume-guarantee synthesis for digital contract signing (Q736809) (← links)
- Augmenting ATL with strategy contexts (Q897650) (← links)
- An abstraction-refinement methodology for reasoning about network games (Q1630443) (← links)
- Buying optimal payoffs in bi-matrix games (Q1630445) (← links)
- On equilibria in quantitative games with reachability/safety objectives (Q1678747) (← links)
- Solution of the Hotelling's game in secure strategies (Q1925866) (← links)
- Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives (Q2029600) (← links)
- Security games over lexicographic orders (Q2056964) (← links)
- A game-theoretic approach for the synthesis of complex systems (Q2104251) (← links)
- Timed network games (Q2112796) (← links)
- Infinite-duration poorman-bidding games (Q2190378) (← links)
- On the existence of weak subgame perfect equilibria (Q2225594) (← links)
- Equilibria in multi-player multi-outcome infinite sequential games (Q2225601) (← links)
- Dynamic resource allocation games (Q2286736) (← links)
- Synthesizing Protocols for Digital Contract Signing (Q2891408) (← links)
- Existence of Secure Equilibrium in Multi-player Games with Perfect Information (Q2922609) (← links)
- On the Existence of Weak Subgame Perfect Equilibria (Q2988365) (← links)
- A Note on Game Theory and Verification (Q3297580) (← links)
- Hierarchical Network Formation Games (Q3303895) (← links)
- (Q3384162) (← links)
- (Q3384875) (← links)
- ATL with Strategy Contexts and Bounded Memory (Q3605522) (← links)
- Incentive Stackelberg Mean-Payoff Games (Q4571136) (← links)
- (Q4607995) (← links)
- Timed network games with clocks (Q5005123) (← links)
- (Q5089158) (← links)
- (Q5092367) (← links)
- (Q5111251) (← links)
- Infinite-Duration Bidding Games (Q5111634) (← links)
- (Q5140263) (← links)
- Games with a Weak Adversary (Q5167831) (← links)
- (Q5856414) (← links)
- The complexity of subgame perfect equilibria in quantitative reachability games (Q5875374) (← links)
- (Q5875381) (← links)
- A game-theoretic approach to indistinguishability of winning objectives as user privacy (Q6605339) (← links)
- Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete (Q6623016) (← links)
