Pages that link to "Item:Q3090850"

The following pages link to The Complexity of Nash Equilibria in Limit-Average Games (Q3090850):

Displaying 23 items.

• Reasoning about equilibria in game-like concurrent systems (Q345709) (← links)
• Equilibria for games with combined qualitative and quantitative objectives (Q824280) (← links)
• Extending finite-memory determinacy to multi-player games (Q1641036) (← links)
• A game-theoretic approach for the synthesis of complex systems (Q2104251) (← links)
• Equilibria in multi-player multi-outcome infinite sequential games (Q2225601) (← links)
• Iterated Boolean games (Q2346405) (← links)
• Mean-payoff games with \(\omega\)-regular specifications (Q2669180) (← links)
• Robust Equilibria in Mean-Payoff Games (Q2811341) (← links)
• On Pure Nash Equilibria in Stochastic Games (Q2948480) (← links)
• A Note on Game Theory and Verification (Q3297580) (← links)
• Incentive Stackelberg Mean-Payoff Games (Q4571136) (← links)
• (Q5013875) (← links)
• (Q5015269) (← links)
• (Q5020524) (← links)
• (Q5089158) (← links)
• (Q5089213) (← links)
• (Q5092367) (← links)
• (Q5140263) (← links)
• The Complexity of Infinitely Repeated Alternating Move Games (Q5326613) (← links)
• (Q5875374) (← links)
• (Q5875383) (← links)
• On the complexity of rational verification (Q6133701) (← links)
• Incentive Engineering for Concurrent Games (Q6199620) (← links)