Pages that link to "Item:Q1161454"
From MaRDI portal
The following pages link to Super-modularity: Applications to convex games and to the greedy algorithm for LP (Q1161454):
Displayed 18 items.
- Characterizations of solutions for games with precedence constraints (Q267093) (← links)
- Core-based criterion for extreme supermodular functions (Q277638) (← links)
- Remarkable polyhedra related to set functions, games and capacities (Q301379) (← links)
- Stable sets and max-convex decompositions of TU games (Q356514) (← links)
- ALOHA networks: a game-theoretic approach (Q376716) (← links)
- An algorithm for finding the vertices of the \(k\)-additive monotone core (Q412376) (← links)
- An average lexicographic value for cooperative games (Q421596) (← links)
- A characterization of convex TU games by means of the Mas-Colell bargaining set (à la Shimomura) (Q422368) (← links)
- Strong convexity of NTU games (Q444126) (← links)
- C-complete sets for compromise stable games (Q471023) (← links)
- A note: characterizations of convex games by means of population monotonic allocation schemes (Q480849) (← links)
- Pyramidal values (Q490156) (← links)
- Extreme points of the Harsanyi set and the Weber set (Q493794) (← links)
- The restricted core of games on distributive lattices: how to share benefits in a hierarchy (Q532527) (← links)
- A generalization of the Shapley-ichiishi result (Q532758) (← links)
- Convex and exact games with non-transferable utility (Q617519) (← links)
- Cores of combined games (Q617687) (← links)
- Assignment games satisfy the CoMa-property (Q700114) (← links)