We consider cooperative games with transferable utility (TU-games), in which we allow for a social structure on the set of players, for instance a hierarchical ordering or a dominance relation. The social structure is utilized to refine the core of the game, being the set of payoffs to the...

In this paper we present a new auction, the bisection auction, that can be used for the sale of a single indivisible object. We discuss the issue concerning the information revelation requirement of this auction and the associated amount of data that needs to be transmitted. We show that in the...

This paper is concerned with the minimal number of profiles at which a unanimous and anonymous social choice function is manipulable. The lower bound is derived when there are three alternatives to choose from. Examples of social choice functions attaining the lower bound are given. We...

This paper is concerned with the number of profiles at which a nondictatorial social choice function is manipulable. For three or more alternatives the lower bound is derived when the social choice function is nondictatorial and unanimous. In the case of three alternatives the lower bound is...

In this paper, we consider a two-stage (sequential) game as introduced by Vickers (1985),Fershtman (1985), Fershtman and Judd (1987) and Sklivas (1987). This game models the situation where the owners of competing firms manipulate their managers'' incentive contracts for strategic reasons....

This paper focuses on the analysis of size distributions of innovations, which are known to be highly skewed. We use patent citations as one indicator of innovation significance, constructing two large datasets from the European and US Patent Offices at a high level of aggregation, and the...

We develop a model of an innovative industry to examine how information technology, by both enhancing matching efficiency and knowledge sharing, can have an ambiguous effect on the total amount of innovation. We consider a population of firms holding different knowledge expertise, and forming...

I consider n-person normal form games where the strategy set of every player is a non-empty compact convex subset of Euclidean space, and the payoff function of player i is continuous and concave in player i''s own strategies. No further restrictions (such as multilinearity of the payoff...

Gibbard''s (1973) and Satterthwaite''s (1975) result implies that anonymous surjective social choice functions on more than two alternatives are manipulable. Placing some mild constraints on the number of agents compared to the number of alternatives, we show what the minimal number of...

We consider cooperative games with transferable utility (TU-games), in which we allow for a social structure on the set of players, for instance a hierarchical ordering or a dominance relation. The social structure is utilized to refine the core of the game, being the set of payoffs to the...