The following pages link to Cores of convex games (Q2547868):
Displaying 50 items.
- Extreme points of coherent probabilities in finite spaces (Q881805) (← links)
- Integral representation of belief measures on compact spaces (Q892183) (← links)
- Subjective independence and concave expected utility (Q896936) (← links)
- The minimum cost spanning forest game (Q899945) (← links)
- Information market games (Q913681) (← links)
- Comparative cooperative game theory (Q922303) (← links)
- Cost allocation: The traveling salesman, bin packing, and the knapsack (Q922949) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- Compromise solutions for bankruptcy situations with references (Q926363) (← links)
- Sequencing games with repeated players (Q926369) (← links)
- Minimal large sets for cooperative games (Q926580) (← links)
- \(p\)-additive games: a class of totally balanced games arising from inventory situations with temporary discounts (Q926590) (← links)
- Production-inventory games and PMAS-games: Characterizations of the Owen point (Q931787) (← links)
- Proportional scheduling, split-proofness, and merge-proofness (Q932808) (← links)
- Computing the cores of strategic games with punishment-dominance relations (Q933749) (← links)
- von Neumann-Morgenstern stable sets of income tax rates in public good economies (Q943346) (← links)
- Effects of uncertainty aversion on the call option market (Q944232) (← links)
- Equivalence of permutation polytopes corresponding to strictly supermodular functions (Q947118) (← 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)
- The lattice of embedded subsets (Q968166) (← links)
- Monge extensions of cooperation and communication structures (Q976406) (← links)
- Submodular function minimization (Q995782) (← links)
- Degree of imprecision: geometric and algorithmic approaches (Q997034) (← links)
- Regular population monotonic allocation schemes (Q997937) (← links)
- Production-inventory games: A new class of totally balanced combinatorial optimization games (Q1002332) (← links)
- Farsighted coalitional stability in TU-games (Q1005742) (← links)
- Selecting equilibria in common agency games (Q1007323) (← links)
- Random and fuzzy sets in coarse data analysis (Q1010347) (← links)
- A faster strongly polynomial time algorithm for submodular function minimization (Q1016120) (← links)
- Sure wins, separating probabilities and the representation of linear functionals (Q1018312) (← links)
- Extended cooperative networks games (Q1028468) (← links)
- On core stability, vital coalitions, and extendability (Q1036591) (← 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)
- \(k\)-balanced games and capacities (Q1042499) (← links)
- The epsilon core of a large replica game (Q1054642) (← links)
- The Shapley transfer value without zero weights (Q1060971) (← links)
- Properties of 1-convex \(n\)-person games (Q1061621) (← links)
- The \(\tau\)-value, the core and semiconvex games (Q1069867) (← links)
- A proof that the core of an ordinal convex game is a von Neumann- Morgenstern solution (Q1069868) (← links)
- Allocating joint costs by means of the nucleolus (Q1076622) (← links)
- A polymatroid associated with convex games (Q1079574) (← links)
- Extensions of solution concepts by means of muliplicative \(\epsilon\)-tax games (Q1091286) (← links)
- Activity optimization games with complementarity (Q1091957) (← links)
- Solution concepts of \(k\)-convex \(n\)-person games (Q1096552) (← links)
- Neutral veto correspondences with a continuum of alternatives (Q1106744) (← links)
- Communication and its cost in graph-restricted games (Q1107455) (← links)
