A seller with two objects faces a group of bidders who are subject to budget constraints. The objects have common values to all bidders, but need not be identical and may be either complements or substitutes. In a simple complete information setting we show: (1) if the objects are sold by means...

We study Bayesian mechanism design in situations where agents' information may be multi-dimensional, concentrating on mechanisms that lead to efficient allocations. Our main result is that a generalization of the well-known Vickrey-Clarke-Groves mechanism maximizes the planner's "revenue'' among...

This paper shows that altruism may be beneficial in bargaining when there is competition for bargaining partners. In a game with random proposers, the most altruistic player has the highest material payoff if players are sufficiently patient. However, this advantage is eroded as the discount...

We study a simple bargaining mechanism in which each player puts a prize to his resources before leaving the game. The only expected final equilibrium payoff can be defined by means of selective marginal contributions vectors, and it coincides with the Shapley value for convex games. Moreover,...

We present a quantum solution to coordination problems that can be implemented with present technologies. It provides an alternative to existing approaches, which rely on explicit communication, prior commitment or trusted third parties. This quantum mechanism applies to a variety of scenarios...

In John Nash’s proofs for the existence of (Nash) equilibria based on Brouwer’s theorem, an iteration mapping is used. A continuous— time analogue of the same mapping has been studied even earlier by Brown and von Neumann. This differential equation has recently been suggested as a...

Fictitious play and ``gradient'' learning are examined in the context of a large population where agents are repeatedly randomly matched. We show that the aggregation of this learning behaviour can be qualitatively different from learning at the level of the individual. This aggregate dynamic...

In this note we study a very simple trial & error learning process in the context of a Cournot oligopoly. Without any knowledge of the payoff functions players increase, respectively decrease, their quantity by one unit as long as this leads to higher profits. We show that this process converges...

We examine a new class of games, which we call social games, where players not only choose strategies but also choose with whom they play. A group of players who are dissatisfied with the play of their current partners can join together and play a new equilibrium. This imposes new refinements on...