Tell me more ×
Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It's 100% free, no registration required.
up vote 0 down vote favorite

I want to find Nash Equilibrium in a game of Inperfect Information.I know the backward algorithm which is uses Perfect information games but I have a very small game of Inperfect Information and I dont know how to handle it.My first naive approach was to check just the leaves but this doesent mean that a have a Nash Equilibrium.In addition I have chance nodes how can I han

share|improve this question
How many players does the game have? – Rahul Savani Mar 3 at 18:48

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.