Pages that link to "Item:Q1414436"
From MaRDI portal
The following pages link to On computational complexity of membership test in flow games and linear production games (Q1414436):
Displayed 13 items.
- Path cooperative games (Q724748) (← links)
- The nucleolus of balanced simple flow networks (Q817277) (← links)
- Computing the least-core and nucleolus for threshold cardinality matching games (Q897924) (← links)
- On characterization of the core of lane covering games via dual solutions (Q1785295) (← links)
- Enforcing fair cooperation in production-inventory settings with heterogeneous agents (Q2241573) (← links)
- The computational complexity of rationalizing boundedly rational choice behavior (Q2427841) (← links)
- Computability of simple games: A characterization and application to the core (Q2482640) (← links)
- Arboricity games: the core and the nucleolus (Q2687037) (← links)
- Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms (Q2957451) (← links)
- The Least-Core and Nucleolus of Path Cooperative Games (Q3196373) (← links)
- COALITION FORMATION GAMES: A SURVEY (Q3444827) (← links)
- (Q3604325) (← links)
- Finding nucleolus of flow game (Q5896983) (← links)