Name
Abstract | ||
|---|---|---|
. We investigate refinements of two solutions, the saddle and the weak saddle, defined by Shapley (1964) for two-player zero-sum
games. Applied to weak tournaments, the first refinement, the mixed saddle, is unique and gives us a new solution, generally lying between the GETCHA and GOTCHA sets of Schwartz (1972, 1986). In the
absence of ties, all three solutions reduce to the usual top cycle set. The second refinement, the weak mixed saddle, is not generally unique, but, in the absence of ties, it is unique and coincides with the minimal covering set. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/s003550000059 | Social Choice and Welfare |
Keywords | Field | DocType |
Minimal Covering,Weak Saddle,Weak Tournament,Mixed Saddle | Saddle,Discrete mathematics,Mathematical economics,Covering set,Mathematics | Journal |
Volume | Issue | ISSN |
18 | 1 | 0176-1714 |
Citations | PageRank | References |
11 | 5.64 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Duggan | 1 | 241 | 145.72 |
| Michel Le Breton | 2 | 91 | 24.03 |