The following pages link to (Q4369423):
Displayed 26 items.
- Stable sets of allocations and the provision of public goods (Q324339) (← links)
- A note on extended stable sets (Q331706) (← links)
- Stable sets and max-convex decompositions of TU games (Q356514) (← links)
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- A characterisation of stable sets in preordered structure (Q427567) (← links)
- On the solution of \(w\)-stable sets (Q502372) (← links)
- Convex vNM-stable sets for linear production games (Q532739) (← links)
- Extendability and von neuman-morgenstern stability of the core (Q532769) (← links)
- Power and efficiency in production pillage games (Q839610) (← links)
- Pillage and property (Q860345) (← links)
- Convex decomposition of games and axiomatizations of the core and the D-core (Q878163) (← links)
- Pillage games with multiple stable sets (Q891340) (← links)
- Minimal large sets for cooperative games (Q926580) (← links)
- On the foundation of stability (Q1028547) (← links)
- Spatial pillage game (Q1045977) (← links)
- The foundation of stability in extensive games with perfect information (Q1049232) (← links)
- Core equivalence theorems for infinite convex games (Q1371185) (← links)
- On the cores of cooperative games and the stability of the Weber set (Q1376988) (← links)
- Symmetric von Neumann-Morgenstern stable sets in pure exchange economies. (Q1399522) (← links)
- Stable sets in majority pillage games (Q2349421) (← links)
- Sufficient conditions for unique stable sets in three agent pillage games (Q2453830) (← links)
- Stability, sequential rationality, and subgame consistency (Q2464019) (← links)
- The vector lattice structure of the \(n\)-person TU games (Q2491880) (← links)
- The Computational Complexity of Choice Sets (Q3392310) (← links)
- Stability and largeness of the core (Q5931924) (← links)
- General systems and \(\varphi\)-stable sets --- a formal analysis of socioeconomic environments (Q5955032) (← links)