A voting protocol is said to be strongly participatory if for any player i and any strategy profile either the outcome is i‘s preferred one or has a strategy which would ensure her a better outcome, and VNMstrategy proof if at any preference profile the set of sincere strategies of each player...

It is argued that virtually all coalitional, strategic and extensive game formats as currently employed in the extant game-theoretic literature may be presented in a natural way as discrete nonfull or even-under a suitable choice of morphisms- as full subcategories of Chu (Poset 2).

This paper contributes to the task of classifying game forms from a structural point of view by studying properties of their concept-or Galoislattices. A characterization of those coalitional game forms that have topological closure systems is provided.It is also shown that CGFs with topological...

In this paper a government form is modeled as an effectivity function scheme (EFS) i.e. a parameterized family of effectivity functions having admissible (strong) weight-profiles as the relevant parameters. Working in a 2-jurisdiction outcome space we show that the existence of umpires is...

We address the problem of ranking distributions of opportunity sets in terms of poverty. In order to accomplish this task, we identify a suitable notion of `multidimensional poverty line', extend the most widely used income poverty criteria to opportunity profiles, and provide characterizations...

The domain of polyconvex sets, i.e. finite unions of convex, compact, Euclidean sets, is large enough to encompass most of the opportunity sets typically encountered in economic environments, including non-linear or even non-convex budget sets, and opportunity sets arising from production sets....

The concept lattice of a coalitional game form is introduced and advocated as a structural classificatory tool. The basic properties of such lattices are studied. Sufficient concept-latticial properties for convexity of the underlying coalitional game form are identified. Spectral issues...

It is shown that concept lattices can be attached in a natural way to any voting protocol. The concept lattices of some voting protocols that are solvable with respect to some prominnent solution concepts and outcome-efficient are studied: it is proved that they typically amount to chains

This paper studies Collective Identification Procedures in a finite lattice when the standard Independence axiom is dropped and replaced with an Independent Qualified Certification requirement

It is argued that if the population of options is a finite poset, diversity comparisons may be conveniently based on widths i.e. on the respective maximum numbers of pairwise incomparable options included in the relevant subposets. The width-ranking and the undominated width-ranking are...