Cores of convex games
From MaRDI portal
Publication:2547868
DOI10.1007/BF01753431zbMath0222.90054WikidataQ55980201 ScholiaQ55980201MaRDI QIDQ2547868
Publication date: 1971
Published in: International Journal of Game Theory (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
Sequencing games with controllable processing times ⋮ Characterizations of solutions for games with precedence constraints ⋮ Duality and anti-duality in TU games applied to solutions, axioms, and axiomatizations ⋮ Core-based criterion for extreme supermodular functions ⋮ Order cones: a tool for deriving \(k\)-dimensional faces of cones of subfamilies of monotone games ⋮ A precedence constraint value revisited ⋮ On competitiveness in uniform utility allocation markets ⋮ Stable allocations of risk ⋮ Extreme lower probabilities ⋮ Proportionate flow shop games ⋮ Efficient firm groups: allocative efficiency in cooperative games ⋮ Remarkable polyhedra related to set functions, games and capacities ⋮ Joining the CCS club! The economics of CO\(_2\) pipeline projects ⋮ Economic lot-sizing games ⋮ Coincidence of cooperative game theoretic solutions in the appointment problem ⋮ Peter Fishburn's analysis of ambiguity ⋮ The mean-partition problem ⋮ A rescheduling and cost allocation mechanism for delayed arrivals ⋮ Stable sets and max-convex decompositions of TU games ⋮ Stability and fairness in models with a multiple membership ⋮ Large newsvendor games ⋮ Convex decomposition of games and axiomatizations of the core and the D-core ⋮ The Shapley value of exact assignment games ⋮ Minimum norm solutions for cooperative games ⋮ ALOHA networks: a game-theoretic approach ⋮ Accessibility and stability of the coalition structure core ⋮ New characterizations for largeness of the core ⋮ Extreme points of coherent probabilities in finite spaces ⋮ Monotonicity of social welfare optima ⋮ The equivalence of uniform and Shapley value-based cost allocations in a specific game ⋮ Algebraic duality theorems for infinite LP problems ⋮ Convex and exact games with non-transferable utility ⋮ Cores of combined games ⋮ Integral representation of belief measures on compact spaces ⋮ One-to-many bargaining when pairwise agreements are non-renegotiable ⋮ Cooperative interval games: a survey ⋮ Subjective independence and concave expected utility ⋮ An algorithm for finding the vertices of the \(k\)-additive monotone core ⋮ A new stable and more responsive cost sharing solution for minimum cost spanning tree problems ⋮ An average lexicographic value for cooperative games ⋮ A game theoretical approach to sharing penalties and rewards in projects ⋮ Characterizing the Shapley value in fixed-route traveling salesman problems with appointments ⋮ A characterization of convex TU games by means of the Mas-Colell bargaining set (à la Shimomura) ⋮ Cooperative location games based on the minimum diameter spanning Steiner subgraph problem ⋮ Trading water along a river ⋮ On the set of imputations induced by the \(k\)-additive core ⋮ The maximum and the addition of assignment games ⋮ Aubin cores and bargaining sets for convex cooperative fuzzy games ⋮ A new class of convex games on \(\sigma\)-algebras and the optimal partitioning of measurable spaces ⋮ Balancedness conditions for exact games ⋮ On graphs which can or cannot induce Chinese Postman games with a non-empty core ⋮ Strong convexity of NTU games ⋮ Transferable utility games with uncertainty ⋮ A convex representation of totally balanced games ⋮ C-complete sets for compromise stable games ⋮ Adaptation and the allocation of pollution reduction costs ⋮ The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game ⋮ Core-stable rings in second price auctions with common values ⋮ Understanding the coincidence of allocation rules: symmetry and orthogonality in TU-games ⋮ A note: characterizations of convex games by means of population monotonic allocation schemes ⋮ An impossibility theorem for allocation aggregation ⋮ Minimum cost arborescences ⋮ Non-constant discounting and differential games with random time horizon ⋮ On the complexity of submodular function minimisation on diamonds ⋮ Modeling profit sharing in combinatorial exchanges by network flows ⋮ Extreme points of the Harsanyi set and the Weber set ⋮ Sandwich games ⋮ Inferential processes leading to possibility and necessity ⋮ Capital allocation for portfolios with non-linear risk aggregation ⋮ On optimal partitions, individual values and cooperative games: does a wiser agent always produce a higher value? ⋮ Vertical syndication-proof competitive prices in multilateral assignment markets ⋮ Path-disruption games: bribery and a probabilistic model ⋮ A monotonic core solution for convex TU games ⋮ Reduced games and egalitarian solutions ⋮ The restricted core of games on distributive lattices: how to share benefits in a hierarchy ⋮ A generalization of the Shapley-ichiishi result ⋮ Extendability and von neuman-morgenstern stability of the core ⋮ Partial probabilistic information ⋮ Cooperative game theory and inventory management ⋮ Assignment games satisfy the CoMa-property ⋮ (Sophisticated) stable sets in exchange economies ⋮ On Chinese postman games where residents of each road pay the cost of their road ⋮ Search and Knightian uncertainty ⋮ Benefit sharing in holding situations ⋮ Random sets as imprecise random variables ⋮ Minimal exact balancedness ⋮ Weighted component fairness for forest games ⋮ Insurance with multiple insurers: a game-theoretic approach ⋮ Ensuring the boundedness of the core of games with restricted cooperation ⋮ The boundary of the core of a balanced game: face games ⋮ The nestedness property of the convex ordered median location problem on a tree ⋮ A note on Frank's generalized polymatroids ⋮ Symmetric solutions for symmetric games with large cores ⋮ Scale economies and existence of sustainable monopoly prices ⋮ An axiomatization of the weighted NTU value ⋮ On the convexity of communication games ⋮ Supermodularity in mean-partition problems ⋮ On games arising from multi-depot Chinese postman problems ⋮ Communication and cooperation in public network situations ⋮ On the convexity of precedence sequencing games
Cites Work
This page was built for publication: Cores of convex games
