We prove that pillage games (Jordan, 2006, “Pillage and property”, JET) can have multiple stable sets, constructing pillage games with up to 2^{(n-1)/3} stable sets, when the number of agents, n, exceeds four. We do so by violating the anonymity axiom common to the existing literature,...

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