Published online by Cambridge University Press: 07 February 2011
Game theory is becoming central to the design and analysis of computational mechanisms in which multiple entities interact strategically. The tools of mechanism design are used extensively to engineer incentives for truth revelation into resource allocation (e.g. combinatorial auctions) and preference aggregation protocols (e.g. voting). We argue that mechanism design can also be useful in the design of logical inference procedures. In particular, it can help us understand and engineer inference procedures when knowledge is distributed among self-interested agents. We set a research agenda for this emerging area, and point to some early research efforts.