We generalize the concept of a cooperative non-transferable utility game by introducing a socially structured game. In a socially structured game every coalition of players can organize themselves according to one or more internal organizations to generate payoffs. Each admissible internal organization on a coalition yields a set of payoffs attainable by the members of this coalition. The strengths of the players within an internal organization depend on the structure of the internal organization and are represented by an exogenously given (...) power vector. More powerful players have the power to take away payoffs of the less powerful players as long as those latter players are not able to guarantee their payoffs by forming a different internal organization within some coalition in which they have more power.We introduce the socially stable core as a solution concept that contains those payoffs that are both stable in an economic sense, i.e., belong to the core of the underlying cooperative game, and stable in a social sense, i.e., payoffs are sustained by a collection of internal organizations of coalitions for which power is distributed over all players in a balanced way. The socially stable core is a subset and therefore a refinement of the core. We show by means of examples that in many cases the socially stable core is a very small subset of the core.We will state conditions for which the socially stable core is non-empty. In order to derive this result, we formulate a new intersection theorem that generalizes the KKMS intersection theorem. We also discuss the relationship between social stability and the wellknown concept of balancedness for NTU-games, a sufficient condition for non-emptiness of the core. In particular we give an example of a socially structured game that satisfies social stability and therefore has a non-empty core, but whose induced NTU-game does not satisfy balancedness in the general sense of Billera. (shrink)

Sixteenth-century Nahua philosophy understands neltiliztli (truth) and tlamitilizli (wisdom, knowledge) nonsemantically in terms of a complex notion consisting of well-rootedness, alethia ,authenticity, adeptness, moral righteousness, beauty, and balancedness. In so doing, it offers compelling a posteriori grounds for denying what Alvin Goldman calls veritism .Veritism defends the universality of correspondence (semantic) truth as well as the universal centrality of correspondence (semantic) truth to epistemology. Key Words: truth • veritism • Nahua philosophy • Aztec philopsophy • mesoamerican philosophy • teotl (...) • Alvin Goldman • Martin Heidegger. (shrink)

Standard models in epistemic game theory make strong assumptions about agents’ knowledge of their own beliefs. Agents are typically assumed to be introspectively omniscient: if an agent believes an event with probability p, she is certain that she believes it with probability p. This paper investigates the extent to which this assumption can be relaxed while preserving some standard epistemic results. Geanakoplos (1989) claims to provide an Agreement Theorem using the “truth” axiom, together with the property of balancedness, a (...) significant relaxation of introspective omniscience. I provide an example which shows that Geanakoplos’s statement is incorrect. I then introduce a new property, local balancedness, which allows us both to correct Geanakoplos’s result, and to extend it to cases where the truth axiom may fail. I exploit this general Agreement Theorem to provide novel epistemic conditions for correlated and Nash equilibrium, both of which relax the assumption of introspective omniscience. In all three cases, the results are also extended to infinite state spaces. (This is Chapter 5 of my 2014 Oxford DPhil (PhD) thesis.). (shrink)

We generalize the concept of a cooperative non-transferable utility game by introducing a socially structured game. In a socially structured game every coalition of players can organize themselves according to one or more internal organizations to generate payoffs. Each admissible internal organization on a coalition yields a set of payoffs attainable by the members of this coalition. The strengths of the players within an internal organization depend on the structure of the internal organization and are represented by an exogenously given (...) power vector. More powerful players have the power to take away payoffs of the less powerful players as long as those latter players are not able to guarantee their payoffs by forming a different internal organization within some coalition in which they have more power.We introduce the socially stable core as a solution concept that contains those payoffs that are both stable in an economic sense, i.e., belong to the core of the underlying cooperative game, and stable in a social sense, i.e., payoffs are sustained by a collection of internal organizations of coalitions for which power is distributed over all players in a balanced way. The socially stable core is a subset and therefore a refinement of the core. We show by means of examples that in many cases the socially stable core is a very small subset of the core.We will state conditions for which the socially stable core is non-empty. In order to derive this result, we formulate a new intersection theorem that generalizes the KKMS intersection theorem. We also discuss the relationship between social stability and the wellknown concept of balancedness for NTU-games, a sufficient condition for non-emptiness of the core. In particular we give an example of a socially structured game that satisfies social stability and therefore has a non-empty core, but whose induced NTU-game does not satisfy balancedness in the general sense of Billera. (shrink)