The kernel and bargaining set for convex games
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1929535 (Why is no real title available?)
- scientific article; zbMATH DE number 3214144 (Why is no real title available?)
- A characterization, existence proof and dimension bounds for the kernel of a game
- An inductive method for constructing mimmal balanced collections of finite sets
- Cores of convex games
- On Minimal Separating Collections
- On the Nucleolus of a Characteristic Function Game
- On the minimal basis of a completely separating matrix
- The Core of an N Person Game
- The Nucleolus of a Characteristic Function Game
- The Structure of the Kernel of a Cooperative Game
- The inequalities that determine the bargaining set \({\mathcal M}_ 1^ {(1)}\).
- The kernel of a cooperative game
Cited in
(only showing first 100 items - show all)- A non-cooperative interpretation of the kernel
- The kernel for the grand coalition of the four-person game
- The bilateral consistent prekernel for NTU games
- On the properties of weighted minimum colouring games
- On a class of market games
- Characterizations of highway toll pricing methods
- On games arising from multi-depot Chinese postman problems
- Sharing costs in highways: a game theoretic approach
- Core equivalence theorems for infinite convex games
- Solution concepts of \(k\)-convex \(n\)-person games
- Axiomatizations of symmetrically weighted solutions
- On the submodularity of multi-depot traveling salesman games
- Characterizations of the core of TU and NTU games with communication structures
- On graphs which can or cannot induce Chinese Postman games with a non-empty core
- Bisection property of the kernel
- Upper and lower bounds of the kernel and nucleolus
- Existence of fuzzy prekernels and Mas-Colell bargaining sets in TU games
- Hyperadditive games and applications to networks or matching problems
- On a dynamic theory for the kernel of an \(n\)-person game
- The prenucleolus and the prekernel for games with communication structures
- Remarks on the reasonable set of outcomes in a general coalition function form game
- Reduced two-bound core games
- The positive core of a cooperative game
- On the convexity of precedence sequencing games
- SOME RESULTS ON (PRE)KERNEL CATCHERS AND THE COINCIDENCE OF THE KERNEL WITH PREKERNEL
- A consistent bargaining set
- The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties
- The reactive bargaining set: Structure, dynamics and extension to NTU games
- -component additive games
- A characterization of the nucleolus for convex games
- Axiomatizations of game theoretical solutions for one-output cost sharing problems
- On the reduced game property and its converse
- On the core of network synthesis games
- An equivalence theorem for a bargaining set
- Airport problems and consistent allocation rules.
- Communication and cooperation in public network situations
- Cooperative games with coalition structures
- Aubin cores and bargaining sets for convex cooperative fuzzy games
- On the equivalence between some local and global Chinese postman and traveling salesman graphs
- An extension of the KKMS theorem
- On the convexity of independent set games
- Strategic basins of attraction, the path dominance core, and network formation games
- SUOWA operators: constructing semi-uninorms and analyzing specific cases
- The bargaining set for almost-convex games
- Games with a local permission structure: separation of authority and value generation
- Regular population monotonic allocation schemes
- The asymptotic nucleolus of large monopolistic market games
- Traveling salesman games with the Monge property
- A characterization of convex games by means of bargaining sets
- The kernel is in the least core for permutation games
- The modified nucleolus: Properties and axiomatizations
- The kernel/nucleolus of a standard tree game
- Reinterpreting the kernel
- The bounded core for games with precedence constraints
- On Chinese postman games where residents of each road pay the cost of their road
- Extreme convex set functions with finite carrier: General theory
- The prenucleolus for games with restricted cooperation
- The family of least square values for transferable utility games
- A competitive test of the descriptive accuracy of the characteristic function, power function, and Shapley value based function
- Non-binding agreements and fairness in commons dilemma games
- Naturally submodular digraphs and forbidden digraph configurations
- The least square prenucleolus and the least square nucleolus. Two values for TU games based on the excess vector
- On the relationships between some games associated with SUOWA and semi-SUOWA operators
- Consistency, anonymity, and the core on the domain of convex games
- A proof that the core of an ordinal convex game is a von Neumann- Morgenstern solution
- Dynamics of cooperative games
- The complexity of matching games: a survey
- Equivalence between bargaining sets and the core in simple games
- Graphs inducing totally balanced and submodular Chinese postman games
- A necessary and sufficient condition for the convexity in oligopoly games
- Characterizing convexity of games using marginal vectors
- On Bargaining Sets of Convex NTU Games
- Cores of convex games
- On (non-) monotonicity of cooperative solutions
- Economic lot-sizing games
- A study of SUOWA operators in two dimensions
- The bargaining set of a large game
- Shapley values and tolerance indices of the operators obtained with the crescent method
- Existence of an Aumann-Maschler fuzzy bargaining set and fuzzy kernels in TU fuzzy games
- Consistency implies equal treatment in TU-games
- An efficient characterization of submodular spanning tree games
- Collecting information to improve decision-making
- Nonsymmetric variants of the prekernel and the prenucleolus
- Properties of 1-convex n-person games
- SUOWA operators: an analysis of their conjunctive/disjunctive character
- Convex games without side payments
- The partnered core of a game with side payments
- A generalization of the CIS value for cooperative cost games
- Coalition formation in simple games with dominant players
- A class of extreme convex set functions with finite carrier
- Average monotonic cooperative games
- Consistency, converse consistency, and aspirations in TU-games.
- An existence theorem for a bargaining set
- My joint work with Michael Maschler
- Intersecting balanced families of sets
- On Harsanyi dividends and asymmetric values
- The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
- The kernel for reasonable outcomes in a cooperative game
- The kernel of the sum of two cooperative games
- Networks and stability
This page was built for publication: The kernel and bargaining set for convex games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2557180)