Super-modularity: Applications to convex games and to the greedy algorithm for LP
From MaRDI portal
Publication:1161454
DOI10.1016/0022-0531(81)90007-7zbMath0478.90092OpenAlexW1994465572MaRDI QIDQ1161454
Publication date: 1981
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0531(81)90007-7
greedy algorithmShapley valuecoreconvex gamesuper-modularitysub-modularitymarginal worth vectorsuper-modular function
Related Items (only showing first 100 items - show all)
CONVEX GAMES VERSUS CLAN GAMES ⋮ A bankruptcy problem and an information trading problem: Applications tok-convex games ⋮ The core of a transferable utility game as the solution to a public good market demand problem ⋮ Core stability of the Shapley value for cooperative games ⋮ Finding the Set of k-additive Dominating Measures Viewed as a Flow Problem ⋮ Computing Superdifferentials of Lovász Extension with Application to Coalitional Games ⋮ CONVEXITY IN STOCHASTIC COOPERATIVE SITUATIONS ⋮ The core of games on ordered structures and graphs ⋮ Characterizations ofk-Convex Games ⋮ On the convexity of games corresponding to sequencing situations with due dates. ⋮ Augmenting and Decreasing Systems ⋮ THE MARGINAL OPERATORS FOR GAMES ON CONVEX GEOMETRIES ⋮ Sequencing games with controllable processing times ⋮ Characterizations of solutions for games with precedence constraints ⋮ A characterization of the core of convex games through Gâteaux derivatives ⋮ Core-based criterion for extreme supermodular functions ⋮ Three-valued simple games ⋮ A Mazur-Orlicz type theorem for submodular set functions ⋮ The socially stable core in structured transferable utility games ⋮ Characterizing convexity of games using marginal vectors ⋮ Continuity properties of solution concepts for cooperative games ⋮ Remarkable polyhedra related to set functions, games and capacities ⋮ Activity optimization games with complementarity ⋮ Partitioning sequencing situations and games ⋮ Solution concepts of \(k\)-convex \(n\)-person games ⋮ Even and odd marginal worth vectors, Owen's multilinear extension and convex games ⋮ Hierarchical organization structures and constraints on coalition formation ⋮ How to share joint liability: a cooperative game approach ⋮ Component efficient solutions in line-graph games with applications ⋮ Economic lot-sizing games ⋮ Monotonicity of the core and value in dynamic cooperative games ⋮ On Harsanyi Dividends and Asymmetric Values ⋮ k-convexn-person games and their cores ⋮ On games corresponding to sequencing situations with ready times ⋮ Convexity of integer veto and elimination procedures ⋮ Stable sets and max-convex decompositions of TU games ⋮ Lexicographic allocations and extreme core payoffs: the case of assignment games ⋮ Proof of permutationally convexity of MCSF games ⋮ Some characterizations of lower probabilities and other monotone capacities through the use of Möbius inversion ⋮ Clique games: a family of games with coincidence between the nucleolus and the Shapley value ⋮ The Shapley value of exact assignment games ⋮ Random reduction consistency of the Weber set, the core and the anti-core ⋮ ALOHA networks: a game-theoretic approach ⋮ Population monotonic allocation schemes for games with externalities ⋮ Cores and Weber sets for fuzzy extensions of cooperative games ⋮ The intermediate set and limiting superdifferential for coalitional games: between the core and the Weber set ⋮ Convex and exact games with non-transferable utility ⋮ Cores of combined games ⋮ Minimum cost spanning tree games and spillover stability ⋮ A bankruptcy approach to the core cover ⋮ Sharing pollution permits under welfare upper bounds ⋮ An algorithm for finding the vertices of the \(k\)-additive monotone core ⋮ Supermodular NTU-games ⋮ An average lexicographic value for cooperative games ⋮ A characterization of convex TU games by means of the Mas-Colell bargaining set (à la Shimomura) ⋮ Characterization of the extreme core allocations of the assignment game. ⋮ Analysis of the core of multisided Böhm-Bawerk assignment markets ⋮ An optimal bound to access the core in TU-games ⋮ Convex fuzzy games and participation monotonic allocation schemes. ⋮ Cooperative games on simplicial complexes ⋮ Strong convexity of NTU games ⋮ On the equivalence between some local and global Chinese postman and traveling salesman graphs ⋮ Comparative cooperative game theory ⋮ Minimal large sets for cooperative games ⋮ C-complete sets for compromise stable games ⋮ Monotonicity of solutions in certain dynamic cooperative games ⋮ 2-monotone outer approximations of coherent lower probabilities ⋮ A note on the permutationally convex games ⋮ Computing the cores of strategic games with punishment-dominance relations ⋮ A note: characterizations of convex games by means of population monotonic allocation schemes ⋮ The core and the Weber set for bicooperative games ⋮ Pyramidal values ⋮ Extreme points of the Harsanyi set and the Weber set ⋮ The cone of supermodular games on finite distributive lattices ⋮ The core and the steady bargaining set for convex games ⋮ Sequencing situations and games with non-linear cost functions under optimal order consistency ⋮ Bankruptcy games with nontransferable utility ⋮ A characterization of convex games by means of bargaining sets ⋮ On the core, the Weber set and convexity in games with a priori unions ⋮ The restricted core of games on distributive lattices: how to share benefits in a hierarchy ⋮ A generalization of the Shapley-ichiishi result ⋮ On the restricted cores and the bounded core of games on distributive lattices ⋮ Cores of convex and strictly convex games ⋮ The core and the Weber set of games on augmenting systems ⋮ A new proof for Weber's characterization of the random order values ⋮ Assignment games satisfy the CoMa-property ⋮ The Lovász extension of market games ⋮ Various characterizations of convex fuzzy games ⋮ Monge extensions of cooperation and communication structures ⋮ The selectope for bicooperative games ⋮ On the Harsanyi payoff vectors and Harsanyi imputations ⋮ Consistency of the equal split-off set ⋮ On the vertices of the \(k\)-additive core ⋮ The core of games on convex geometries ⋮ The Shapley value and average convex games ⋮ Cores and large cores when population varies ⋮ Equivalence between bargaining sets and the core in simple games ⋮ Marginal contributions and derivatives for set functions in cooperative games ⋮ Ensuring the boundedness of the core of games with restricted cooperation ⋮ On the concavity of delivery games
Cites Work
This page was built for publication: Super-modularity: Applications to convex games and to the greedy algorithm for LP
