Dynamic stable set as a tournament solution ∗ Hannu
نویسندگان
چکیده
We define a notion of dynamic (vNM) stable set for a tournament relation. Dynamic stable set satisfies (i) an external direct stability property, and (ii) an internal indirect stability property. Importantly, stability criteria are conditioned on the histories of past play, i.e. the dominance system has memory. Due to the asymmetry of the defining stability criteria, a dynamic stable set is stable both in the direct and in the indirect sense. We characterize a dynamic stable set directly in terms of the underlying tournament relation. A connection to the covering set of Dutta (1988) is established. Using this observation, a dynamic stable set exists. We also show that a maximal implementable outcome set is a version of the ultimate uncovered
منابع مشابه
A new old solution for weak tournaments
This note uncovers new properties of the von Neumann-Morgenstern solution in weak tournaments and majoritarian games. We propose a new procedure for the construction of choice sets from weak tournaments, based on dynamic stability criteria. The idea is to analyze dynamic versions of the tournament game introduced by Laffond, Laslier and Le Breton (1993) [The bipartisan set of a tournament game....
متن کاملMinimal stable sets in tournaments
We propose a systematic methodology for defining tournament solutions as extensions of maximality. The central concepts of this methodology are maximal qualified subsets and minimal stable sets. We thus obtain an infinite hierarchy of tournament solutions, encompassing the top cycle, the uncovered set, the Banks set, the minimal covering set, and the tournament equilibrium set. Moreover, the hi...
متن کاملOn the Structure of Stable Tournament Solutions
A fundamental property of choice functions is stability, which, loosely speaking, prescribes that choice sets are invariant under adding and removing unchosen alternatives. We provide several structural insights that improve our understanding of stable choice functions. In particular, (i) we show that every stable choice function is generated by a unique simple choice function, which never excl...
متن کاملVon Neumann-Morgenstern Stable Sets and the Non-cooperative Solution to the Bargaining Problem
We establish a general n-player link between non-cooperative bargaining and the Nash solution. Non-cooperative bargaining is captured in a reduced form through the von Neumann-Morgenstern (1944) stability concept. A stable set always exists. Moreover, if the utility set has a smooth surface, then any stable set converges to the Nash bargaining solution. Finally, the equivalence of stationary eq...
متن کاملMajority Voting in Stable Marriage Problem with Couples
Providing centralised matching services can be viewed as a group decision support system (GDSS) for the participants to reach a stable matching solution. In the original stable marriage problem all the participants have to rank all members of the opposite party. Two variations for this problem allow for incomplete preference lists and ties in preferences. If members from one side are allowed to...
متن کامل