Abstract
The present paper introduces bicooperative games and develops some general values on the vector space of these games. First, we define biprobabilistic values for bicooperative games and observe in detail the axioms that characterize such values. Following the work of Weber [R.J. Weber, Probabilistic values for games, in: A.E. Roth (Ed.), The Shapley Value: Essays in Honor of Lloyd S. Shapley Cambridge University Press, Cambridge, 1988, pp. 101–119], these axioms are sequentially introduced observing the repercussions they have on the value expression. Moreover, compatible-order values are introduced and there is shown the relationship between these values and efficient values such that their components are biprobabilistic values.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
