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