In auction theory and mechanism design, Border's theorem gives a necessary and sufficient condition for interim allocation rules (or reduced form auctions) to be implementable via an auction.
It was first proven by Kim Border in 1991,[1] expanding on work from Steven Matthews,[2] Eric Maskin and John Riley.[3] A similar version with different hypotheses was proven by Border in 2007.[4]