We introduce 'formal methods' of mechanized reasoning from computer science to address two problems in auction design and practice: is a given auction design soundly specified, possessing its intended properties; and, is the design faithfully implemented when actually run? Failure on either...

Pillage games [Jordan, 2006, "Pillage and Property", JET] have two features that make them richer than cooperative games in either characteristic or partition function form: they allow power externalities between coalitions; they allow resources to contribute to coalitions' power as well as to...

See Birmingham Discussion Paper 05-05R (January 2006) for current version.

See Birmingham Discussion Paper 05-19 (December 2005) for current version.

We study extinction in a commons problem in which agents have access to capital markets. When the commons grows more quickly than the interest rate, multiple equilibria are found for intermediate commons endowments. In one of these, welfare decreases as the resource becomes more abundant, a...

We study option management by committee. Analysis is illustrated by tenure decisions. Our innovations are two-fold: we treat the committee's problem as one of social choice, not of information aggregation; and we endogenise the outside option: rejecting a candidate at either the probationary or...

We present an original theorem in auction theory: it specifies general conditions under which the sum of the payments of all bidders is necessarily not identically zero, and more generally not constant. Moreover, it explicitly supplies a construction for a finite minimal set of possible bids on...

Pillage games (Jordan, 2006a) have two features that make them richer than cooperative games in either characteristic or partition function form: they allow power externalities between coalitions; they allow resources to contribute to coalitions’ power as well as to their utility. Extending...