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...

As the internet makes the transition from research testbed to commercial enterprise, the topic of pricing in computer networks has suddenly attracted great attention. Much of the discussion in the network design community and the popular press centers on the usage-based versus flat pricing...

The authors consider the problem of cost sharing in the case of a fixed group of agents sharing a one input, one output technology with decreasing returns. They introduce and analyze the serial cost sharing method. Among agents endowed with convex and monotonic preferences, serial cost sharing...