A lattice fixed-point theorem with constraints

DOI10.1090/S0002-9904-1975-13672-XzbMath0319.06005OpenAlexW2011782253MaRDI QIDQ4081294

Alvin E. Roth

Publication date: 1975

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9904-1975-13672-x

Mathematics Subject Classification ID

Cooperative games (91A12) Complete lattices, completions (06B23) Graph theory (05C99)

Related Items

Connecting the cooperative and competitive structures of the multiple-partners assignment game ⋮ Interior points in the core of two-sided matching markets ⋮ On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints ⋮ An extension and simple proof of a constrained lattice fixed point theorem ⋮ A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games ⋮ Networks and Stability ⋮ General systems and \(\varphi\)-stable sets --- a formal analysis of socioeconomic environments ⋮ Two-person games on graphs

Cites Work

• Unnamed Item
• Subsolutions and the Supercore of Cooperative Games
• A game with no solution