• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта

Новости

Заседание общемосковского научного семинара "Математические методы анализа решений в экономике, бизнесе и политике"

Arkadii Slinko "New Bounds for Simple Games"

Prof. Arkadii Slinko (University of Aukland, New Zealand)

Simple game is a mathematical structure that reflects the distribution of power in a group of players and one of the most natural classes of games are weighted majority games. A simple game is roughly weighted if there exists a system of weights and a threshold such that all coalitions whose combined weight is above the threshold are winning and all coalitions whose combined weight is below the threshold are losing and a tie-breaking is needed to classify the coalitions whose combined weight is exactly the threshold. For example, Gabel'man's games that play a significant role in the theory are roughly weighted but not weighted.

Several necessary and sufficient conditions that guarantee weightedness are known. In this paper we give necessary and sufficient conditions for a simple game to have rough weights. We also define two functions that measure the deviation of a simple game with n players from a weighted majority game and roughly weighted majority game, respectively. We derive lower and upper bounds for these functions. We also investigate rough weightedness of simle games with a small number of players.

Заседание проходило 18 ноября 2009 г. с 16.40 по 18.00 по адресу Покровский бульвар, д. 11, Д-316.