When modeling game situations of incomplete information one usually considers the players’ hierarchies of beliefs, a source of all sorts of complications. Harsányi (1967-68)’s idea henceforth referred to as the ”Harsányi program” is that hierarchies of beliefs can be replaced by...

The solution of a TU cooperative game can be a distribution of the value of the grand coalition, i.e. it can be a distribution of the payo (utility) all the players together achieve. In a regression model, the evaluation of the explanatory variables can be a distribution of the overall t, i.e....

Several game theoretical topics require the analysis of hierarchical beliefs, particularly in incomplete information situations. For the problem of incomplete information, Hars´anyi suggested the concept of the type space. Later Mertens & Zamir gave a construction of such a type space under...

In this paper we consider a primal-dual infinite linear programming problem-pair, i.e. LPs on infinite dimensional spaces with infinitely many constraints. We present two duality theorems for the problem-pair: a weak and a strong duality theorem. We do not assume any topology on the vector...

Certain aspects of advertising–especially on television–are not easily explained with conventional economic models. In particular, much of the imagery and repetitive thematic content seen in advertisements suggests it is "psychological" in nature, as opposed to "informative". To understand...

Computer scientists and social scientists consider the political districting problem from different viewpoints. This paper gives an overview of both strands of the literature on districting in which the connections and the differences between the two approaches are highlighted.

Meier (2008) shows that the universal knowledge-belief space exists. However, besides the universality there is an other important property might be imposed on knowledge-belief spaces, inherited also from type spaces, the completeness. In this paper we introduce the notion of complete...

We generalize exactness to games with non-transferable utility (NTU). A game is exact if for each coalition there is a core allocation on the boundary of its payoff set. Convex games with transferable utility are well-known to be exact. We consider ve generalizations of convexity in the NTU...

The concept of types was introduced by Harsányi[8]. In the literature there are two approaches for formalizing types, type spaces: the purely measurable and the topological models. In the former framework Heifetz and Samet [11] showed that the universal type space exists and later Meier[13]...

Az életben számtalan olyan esettel találkozunk, amikor egy jószág iránti kereslet meghaladja a rendelkezésre álló kínálatot. Példaként említhetjük a kárpótlási igényeket, egy csődbement cég hitelezőinek igényeit, valamely szerv átültetésére váró betegek sorát stb....