The study of 1-convex/1-concave TU games possessing a nonempty core and for which the nucleolus is linear was initiated by Driessen and Tijs (Methods Oper. Res. 46:395-406, 1983) and Driessen (OR Spectrum 7:19-26, 1985). However, until recently appealing abstract and practical examples of these classes of games were missing. The paper solves these drawbacks. We introduce a 1-concave basis for the entire space of all TU games wherefrom it follows that every TU game is either 1-convex/1-concave or is a sum of 1-convex and 1-concave games. Thus we may conclude that the classes of 1-convex/1-concave games constitute rather considerable subsets in the entire game space. On the other hand, an appealing practical example of 1-concave game has cropped up in Sales's study (Ph. D. thesis, 2002) of Catalan university library consortium for subscription to journals issued by Kluwer publishing house. The so-called library game turns out to be decomposable into suitably chosen 1-concave games of the basis mentioned above.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.