Advertisement

Mathematical Methods of Operations Research

, Volume 54, Issue 2, pp 303–313 | Cite as

Information collecting situations and bi-monotonic allocation schemes

  • Rodica Brânzei
  • Stef Tijs
  • Judith Timmer

Abstract.

This paper studies information collecting (IC) situations with the help of cooperative game theory. Relations are established between IC situations and IC games on one hand and information sharing (IS) situations and IS games on the other hand. Further, it is shown that IC games are convex combinations of so-called local games. Properties such as k-convexity and k-concavity are possessed by an IC game if all related local games have the respective properties. Special attention is paid to the classes of k-symmetric IC games and 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. This solution takes the power of the big boss into account.

JEL Classification Number: C71 D89. 
Key words: cooperative games information collecting big boss games bi-monotonic allocation scheme 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Rodica Brânzei
    • 1
  • Stef Tijs
    • 2
  • Judith Timmer
    • 2
  1. 1.Faculty of Computer Science, “Al.I. Cuza” University, 16 Berthelot St., 6600 Iaşi, Romania.RO
  2. 2.CentER and Department of Econometrics and Operations Research, Tilburg University, P.O. Box 90153, 5000 LE Tilburg, The Netherlands.NL

Personalised recommendations