首页 | 本学科首页   官方微博 | 高级检索  
     


Mechanisms for a spatially distributed market
Authors:Moshe Babaioff   Noam Nisan  Elan Pavlov  
Affiliation:aMicrosoft Research, Silicon Valley, Mountain View, CA 94043, USA;bSchool of Engineering and Computer Science, The Hebrew University, Jerusalem, Israel;cMIT, Cambridge, MA, USA
Abstract:We consider the problem of a spatially distributed market with strategic agents. A single good is traded in a set of independent markets, where shipment between markets is possible but costly. The problem has previously been studied in the non-strategic case, in which it can be analyzed and solved as a min-cost-flow problem. We consider the case where buyers and sellers are strategic. Our first result gives a double characterization of the VCG prices, first as distances in a certain residue graph and second as the minimal (for buyers) and maximal (for sellers) equilibrium prices. This provides a computationally efficient, individually rational and incentive compatible welfare maximizing mechanism. This mechanism is, necessarily, not budget balanced and we also provide a budget-balanced mechanism (which is also computationally efficient, incentive compatible and individually rational) that achieves high welfare. Finally, we present results for some extensions of the model.
Keywords:Mechanism design   Spatially distributed market   Auctions   Vickrey–  Clarke–  Groves mechanism
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号