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 50 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)
- Cores and large cores when population varies (Q752022) (← links)
- Ensuring the boundedness of the core of games with restricted cooperation (Q763107) (← links)
- The boundary of the core of a balanced game: face games (Q776857) (← links)
- An axiomatization of the weighted NTU value (Q806695) (← links)
- Communication and cooperation in public network situations (Q816510) (← links)
- On the convexity of precedence sequencing games (Q816513) (← links)
- Sequencing games with controllable processing times (Q818079) (← links)
- Economic lot-sizing games (Q852985) (← links)
- The Shapley value of exact assignment games (Q878169) (← links)
- Comparative cooperative game theory (Q922303) (← links)
- Minimal large sets for cooperative games (Q926580) (← links)
- Computing the cores of strategic games with punishment-dominance relations (Q933749) (← links)
- A characterization of convex games by means of bargaining sets (Q956580) (← links)
- On the core, the Weber set and convexity in games with a priori unions (Q958089) (← links)
- The core and the Weber set of games on augmenting systems (Q968126) (← links)
- Monge extensions of cooperation and communication structures (Q976406) (← links)
- Convex games with an infinite number of players and sequencing situations (Q1039463) (← links)
- Convex interval games (Q1040025) (← links)
- Network flow problems and permutationally concave games (Q1042338) (← links)
- A Mazur-Orlicz type theorem for submodular set functions (Q1084205) (← links)
- Continuity properties of solution concepts for cooperative games (Q1090266) (← links)
- Activity optimization games with complementarity (Q1091957) (← links)
- Solution concepts of \(k\)-convex \(n\)-person games (Q1096552) (← links)
- Convexity of integer veto and elimination procedures (Q1111437) (← links)
- Some characterizations of lower probabilities and other monotone capacities through the use of Möbius inversion (Q1119138) (← links)
- Monotonicity of solutions in certain dynamic cooperative games (Q1173753) (← links)
- A note on the permutationally convex games (Q1174811) (← links)
- The Shapley value and average convex games (Q1260981) (← links)
- On the concavity of delivery games (Q1278793) (← links)
- A necessary and sufficient condition for the convexity in oligopoly games (Q1296504) (← links)
- Minimarg and maximarg operators (Q1321110) (← links)
- Characterization of the extreme core allocations of the assignment game. (Q1408713) (← links)