We study the question of which social choice functions from an abstract type space to a set of outcomes are truthful, i.e., implementable by truthful mechanisms, when utilities are quasi-linear. For convex domains, our main theorem characterizes truthful social choice functions as those...

We conduct laboratory experiments on variants of market scoring rule prediction markets, under different information distribution patterns, to evaluate the efficiency and speed of information aggregation, as well as test recent theoretical results on manipulative behavior by traders. We find...

The current Internet architecture, embodied in the Internet Protocol (IP) network protocol, offers a very simple service model: point-to-point best-effort service. In recent years, several new classes of distributed applications have been developed, such as remote video, multimedia conferencing,...

We consider the sharing of the cost of producing a homogeneous good when the technology has variable returns and individuals have arbitrary demands. We give a full analytical description of the family of costsharing methods that allocate costs in propor tion to demands when returns are constant,...

We address the problem of learning and implementation on the Internet. When agents play repeated games in distributed environments like the Internet, they have very limited {\em a priori} information about the other players and the payoff matrix, and the play can be highly asynchronous....