Abstract
Relations are established between information sharing (IS) situations and IS-games on one hand and information collecting (IC) situations and IC-games on the other hand. It is shown that IC-games can be obtained as convex combinations of so-called local games. Properties are described which IC-games possess if all related local games have the respective properties. Special attention is paid to the classes of convex IC-games and of k-concave IC-games. This last class turns out to consist of total big boss games. For the class of total big boss games a new solution concept is introduced: bi-monotonic allocation schemes.
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.
