scientific article; zbMATH DE number 3813384
From MaRDI portal
Publication:3661353
Cited in
(18)- Properties of 1-convex n-person games
- The \(\tau\)-value, the core and semiconvex games
- Allocating joint costs by means of the nucleolus
- Solution concepts of k-convex n-person games
- Coincidence of and collinearity between game theoretic solutions
- The Shapley value and average convex games
- Compromise values in cooperative game theory
- 1-concave basis for TU games and the library game
- On 1-convexity and nucleolus of co-insurance games
- Two efficient values of cooperative games with graph structure based on \(\tau\)-values
- The general compromise value for cooperative games with transferable utility
- Polytopes of special classes of the balanced transferable utility games
- k-convexn-person games and their cores
- Cost allocation for less-than-truckload collaboration among perishable product retailers
- Cores of combined games
- One-bound core games
- Cooperative game theoretic results from the tuna fishing problem
- The -value for games on matroids.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3661353)