Content deleted Content added
m Signing comment by Dalhamir - "→The issue of optimal/pessimal choice: " |
Iron Condor (talk | contribs) No edit summary |
||
Line 1:
{{GameTheoryProject}}
{{Expand|date=July 2007}}
== Uniqueness of solution ==
The example with the optimal/pessimal matches of the three pairs of people ABC and XYZ indicates that there is at least the possibility of a match not being unique. In this case, there were three pairs of people and three stable solutions. It is obvious that there exist cases where there is one and only one stable solution (where everybody gets their first choice). Is there a way to determine a priori how many stable solutions a given set of preference lists will yield? [[User:Iron Condor|Iron Condor]] ([[User talk:Iron Condor|talk]]) 01:54, 25 August 2010 (UTC)
== Clarification request ==
| |||