作者: Paul R. Kleindorfer , Murat R. Sertel
关键词:
摘要: Abstract A "community" of n agents must determine which its members should provide an indivisible public good. Each the can good, but provision cost varies among agents. We identify here efficient solution concept for such problems and design a class auction-like mechanisms, each Nash implements (and under appropriate domain restrictions fully implements) this. The mechanisms are in spirit "k th lowest bidder" auctions. Journal Economic Literature Classification Numbers: C72, D44, H41.