Optimal-in-expectation redistribution mechanisms
نویسندگان
چکیده
منابع مشابه
Optimal-in-expectation redistribution mechanisms
Many important problems in multiagent systems involve the allocation of multiple resources among the agents. If agents are self-interested, they will lie about their valuations for the resources if they perceive this to be in their interest. The well-known VCG mechanism allocates the items efficiently, is strategy-proof (agents have no incentive to lie), and never runs a deficit. Nevertheless, ...
متن کاملLearning Optimal Redistribution Mechanisms through Neural Networks
We consider a social setting where p public resources/objects are to be allocated among n competing and strategic agents so as to maximize social welfare (the objects should be allocated to those who value them the most). This is called allocative efficiency (AE). We need the agents to report their valuations for obtaining these resources, truthfully referred to as dominant strategy incentive c...
متن کاملOptimal false-name-proof single-item redistribution mechanisms
Although the celebrated Vickrey auction is strategy-proof and guaranteed to achieve an efficient allocation in a singleobject auction, if there exists no outside party (i.e., a seller or an auctioneer) with the right to collect the payment, the collected payment will be wasted. Redistribution mechanisms try to redistribute the payment to participating agents as much as possible without violatin...
متن کاملRedistribution in online mechanisms
Following previous work on payment redistribution in static mechanisms, we develop the theory of redistribution in online mechanisms (e.g., [2, 10, 8]). In static mechanisms, redistribution is important as it increases social welfare in scenarios with no residual claimant. Many online scenarios also do not have a natural residual claimant, and redistribution there is equally important. In this ...
متن کاملDetermining the optimal redistribution
The classical redistribution problem aims at optimally scheduling communications when moving from an initial data distribution Dini to a target distribution Dtar where each processor Pi will host a subset P (i) of data items. However, modern computing platforms are equipped with a powerful interconnection switch, and the cost of a given communication is (almost) independent of the location of i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2010
ISSN: 0004-3702
DOI: 10.1016/j.artint.2009.12.003