3 problems
- 0 votes0 replies0 views
The conjecture that each player prefers the opponent's lexsafe Nash equilibrium
Let a finite two-person game with a tight game form have Alice's and Bob's lexsafe strategies and the corresponding lexsafe Nash equilibrium boxes NE-A and NE-B. Preference conject…
- 0 votes0 replies1 view
Kukushkin's acyclicity conjecture for Nash-solvable subforms
Kukushkin's conjecture. The game form is acyclic.
- 0 votes0 replies0 views
Proper-outcome assignment conjecture for no-sink WTT game forms
Proper-outcome assignment conjecture. Every hyperplane, in any direction, can be assigned its proper outcome, and this assignment produces a feasible assignment.