Stable Networks and Limited Farsigtedness
(2013) UECE Lisbon Meetings 2013: Game Theory and Applications — Location: TEchnical University of Lisbon, Lisbon (Portugal) (7.November.2013)
Files
No attached file found for this publication.
Details
- Authors
- Abstract
- We provide a tractable concept that can be used to study the influence of the degree of farsightedness on network stability. A set of networks G_{K} is a level-K farsightedly stable set if three conditions are satisfied. First, external deviations should be deterred. Second, from any network outside of G_{K} there is a a sequence of farsighted improving paths of length smaller than or equal to K leading to some network in G_{K}. Third, there is no proper subset of G_{K} satisfying the first two conditions. We show that a level-K farsightedly stable set always exists and we provide a sufficient condition for the uniqueness of a level-K farsightedly stable set. There is a unique level-1 farsightedly stable set G₁ consisting of all networks that belong to closed cycles. Level-K farsighted stability leads to a refinement of G₁ for generic allocation rules. We then provide easy to verify conditions for a set to be level-K farsightedly stable and we consider the relationship between limited farsighted stability and efficiency of networks.
- Affiliations
Citations
Mauleon, A. (2013). Stable Networks and Limited Farsigtedness. UECE Lisbon Meetings 2013: Game Theory and Applications, TEchnical University of Lisbon, Lisbon (Portugal). https://hdl.handle.net/2078.5/199031