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 bargaining
Search options answers only
not deleted
user 12863
1
vote
How to achieve the best outcome by a single statement in this game?
Schelling himself gave an answer for Q1 in which A can achieve a surviving probability arbitrarily close to 5/6. I quote the book below. The wording is painfully tortuous at times. But the answer seem …
- 131
0
votes
How to achieve the best outcome by a single statement in this game?
If only one player is allow to make a statement, we have the following Theorems:
Theorem 1: If $N\gt 3$, then survival probability for that contender must be strictly less than $\frac{N-1}N$.
Proof: …
- 131