Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with nash-equilibrium
Search options not deleted
user 23071
A basic solution concept in game theory that requires each player to select their best response to the strategies chosen by others.
0
votes
1
answer
219
views
How to find mixed optimal strategies in this zero-sum game?
I'm trying to solve this problem from last year final exam in game theory:
Consider the zero-sum game $G=(X, Y, g)$ where $X=Y=[0,1]$, and $$\forall (x,y) \in X \times Y: g(x, y)=\max \{x(1-2 y), y(1 …
- 101