The core can be accessed with a bounded number of blocks

DOI10.1016/j.jmateco.2006.09.002zbMath1152.91334OpenAlexW2148318535MaRDI QIDQ861830

László Á. Kóczy

Publication date: 2 February 2007

Published in: Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL: http://econ.core.hu/doc/dp/dp/mtdp0512.pdf

zbMATH Keywords

accessibilitycorecooperative game theoryprimitive recursive algorithms

Mathematics Subject Classification ID

Cooperative games (91A12)

Related Items (10)

On the characterizations of viable proposals ⋮ Accessibility and stability of the coalition structure core ⋮ Stability properties of the core in a generalized assignment problem ⋮ Paths to stability for overlapping group structures ⋮ On the number of blocks required to access the core ⋮ An optimal bound to access the core in TU-games ⋮ On the accessibility of the core ⋮ Accessible outcomes versus absorbing outcomes ⋮ The equivalence of the minimal dominant set and the myopic stable set for coalition function form games ⋮ On the accessibility of core-extensions

Cites Work

• Unnamed Item
• Unnamed Item
• Random paths to stability in the roommate problem
• The coalition structure core is accessible
• Paths to stability for matching markets with couples
• A property of the core
• Random Paths to Stability in Two-Sided Matching
• The Stability of Edgeworth's Recontracting Process
• A Dynamic Theory for the Class of Games with Nonempty Cores
• Viable Proposals

This page was built for publication: The core can be accessed with a bounded number of blocks