In this paper, we use a partition function form game to analyze cartel formation among firms in Cournot competition. We assume that a firm obtains a certain cost advantage that allows it to produce goods at a lower unit cost. We show that if the level of the cost advantage is "moderate", then...

Boolean functions are used to represent individuals' decisions, which are functions of other individuals' decisions. Thus, a set of Boolean functions can be used to represent a n-player strategic form game. To find the equilibria of the game is thus to find the fixed points of the Boolean...

This paper studies a model for cooperative congestion games. There is an array of cooperative games V and a player’s strategy is to choose a subset of the set V. The player gets a certain payoff from each chosen game. The paper demonstrates that if a payoff is the Shapley or the Banzhaf value,...

This paper is a survey of the work in the Nash program for coalitional games, a research agenda proposed by Nash (1953) to bridge the gap between the non-cooperative and cooperative approaches to game theory

It has been proved in many studies that cheap talk has great influence on a players' choice of strategies. But the effect of cheap talk has still not been properly evaluated in game theory. Based on a novel game model with parameters denoting how one player cares for the other's payoff, we can...

This paper aims to contribute to the literature on Nash program by experimentally comparing the results of "structured" (non-cooperative) demand-based and offer-based mechanisms that implement the Shapley value as an ex-ante equilibrium outcome with the results of corresponding "semi-structured"...

This paper studies full implementation problems in (pure and mixed) Nash equilibrium in finite environments. We restrict the designer to adopt<I>finite</I> mechanisms, thus ruling out integer games. We provide a condition, top-<I>D</I> inclusiveness, that together with set-monotonicity is sufficient for mixed...</i></i>

A partially-honest individual is a person who follows the maxim, "Do not lie if you do not have to" to serve your material interest. By assuming that the mechanism designer knows that there is at least one partially-honest individual in a society of n ≥ 3 individuals, a social choice rule...

We consider full-truthful Nash implementation, which requires that truth telling by each agent should be a Nash equilibrium of a direct revelation mechanism, and that the set of Nash equilibrium outcomes of the mechanism should coincide with the f-optimal outcome. We show that restricted...

We examine the relation between coalition-proof Nash equilibrium (Bernheim et al., 1987) and weakly dominated strategies in games with strategic substitutes (SS) and monotone externalities (ME). We show that in sigma-interactive games with SS and ME, every coalition-proof Nash equilibrium is a...