The class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the class of games that have finite winning coalitions. This paper characterizes computable games, strengthens the earlier result that computable games violate...

The Nakamura number of a simple game plays a critical role in preference aggregation (or multi-criterion ranking): the number of alternatives that the players can always deal with rationally is less than this number. We comprehensively study the restrictions that various properties for a simple...

Classify simple games into sixteen “types” in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier) and algorithmic computability. For each such class,...

Background: This paper develops a game theoretic model that analyses the dynamics of competition among the leading domestic aviation firms in the Nigerian aviation industry. It probes the abilities of the prisoner dilemma to describe the subjective behaviour of the firms, which provide a...

This paper provides a general overview of theories and tools to model individual and collective decision-making. In particular, stress is laid on the interaction of several decision-makers. A substantial part of this paper is devoted to utility maximization and its application to collective...

This paper models corporate tax evasion as a game among three players: tax authorities, shareholders and the manager in order to understand the behavior of corporate tax evasion (CTE), its causes and the possible mechanisms that can alleviate it. For this purpose, a three-level programming is...

In the first chapter of this book the basic results within convex and quasiconvex analysis are presented. In Section 2 we consider in detail the algebraic and topological properties of convex sets within Rn together with their primal and dual representations. In Section 3 we apply the results...

Over a century ago, Oliver Wendell Holmes invited scholars to look at law through the lens of probability theory: ‘The prophecies of what the courts will do in fact, and nothing more pretentious, are what I mean by the law'. But Holmes himself, and few others, have taken up this intriguing...

The question of how to optimally design an infrastructure network that may be subject to intelligent threats is of highest interest. We address this problem by considering a Designer-Adversary game of optimal network design for the case of imperfect node defense. In this two-stage game, first...