# Axel Niemeyer (BGSE) 30.11.2022

Posterior implementation is a solution concept for mechanism design with interdependent values. It requires that each agent’s strategy is optimal against the strategies of other agents for every possible message profile. Green and Laffont (1987) give a geometric characterization of posterior implementable social choice functions for binary collective decision problems with two agents and non-transferable utility. This paper generalizes the analysis to any finite number n of agents, with three main insights. First, posterior implementable social choice functions are posterior implementable by score voting: each agent submits a number from a set of consecutive integers; the collective decision is determined by whether or not the sum exceeds a given quota. Second, the possibility for posterior implementation depends crucially on the number of agents: in generic environments with n ≥ 3 agents, a (responsive) social choice function is posterior implementable [...]

Time

Wednesday, 30.11.22 - 04:30 PM
- 05:45 PM

Topic

Posterior implementability in an n-person decision problem

Target groups

Students

Researchers

Location

Juridicum, Faculty Meeting Room

Reservation

not required

Organizer

BGSE

Contact