Speaker:     Tatyana Gvozdeva
Affiliation: The University of Auckland
Title:       A new bound for simple games
Date:        Monday, 13 Jul 2009
Time:        3:00 pm
Location:    Room 401

Comparative probability orders are closely related to simple games and cancellation conditions for these orders are very similar to trading transforms for games. In this talk we exploit this similarity to obtain new examples of simple games using Fishburn’s examples of comparative probability orders. These examples give us a new lower bound on the lengths of certificate of non-weightedness for simple games, which is better than the best known one given by Taylor and Zwicker (1992). Our lower bound is linear in the number of players while the one by Taylor and Zwicker is equal to the square root of n.