Incentive compatible mechanism design for synthetic task allocation in virtual organizations

Author(s):  
Linli He ◽  
T.R. Ioerger
Econometrica ◽  
2019 ◽  
Vol 87 (4) ◽  
pp. 1367-1390 ◽  
Author(s):  
Yi-Chun Chen ◽  
Wei He ◽  
Jiangtao Li ◽  
Yeneng Sun

We consider a general social choice environment that has multiple agents, a finite set of alternatives, independent types, and atomless type distribution. We show that for any Bayesian incentive compatible mechanism, there exists an equivalent deterministic mechanism that (1) is Bayesian incentive compatible; (2) delivers the same interim expected allocation probabilities and the same interim expected utilities for all agents; and (3) delivers the same ex ante expected social surplus. This result holds in settings with a rich class of utility functions, multidimensional types, interdependent valuations, and in settings without monetary transfers. To prove our result, we develop a novel methodology of mutual purification, and establish its link with the mechanism design literature.


2019 ◽  
Vol 129 (623) ◽  
pp. 2779-2804 ◽  
Author(s):  
Tingting Ding ◽  
Andrew Schotter

Abstract While the mechanisms that economists design are typically static, one-shot games, in the real world, mechanisms are used repeatedly by generations of agents who engage in them for a short period of time and then pass on advice to their successors. Hence, behaviour evolves via social learning and may diverge dramatically from that envisioned by the designer. We demonstrate that this is true of school matching mechanisms—even those for which truth-telling is a dominant strategy. Our results indicate that experience with an incentive-compatible mechanism may not foster truthful revelation if that experience is achieved via social learning.


Author(s):  
Vijay Menon ◽  
Kate Larson

We study the classic cake cutting problem from a mechanism design perspective, in particular focusing on deterministic mechanisms that are strategyproof and fair. We begin by looking at mechanisms that are non-wasteful and primarily show that for even the restricted class of piecewise constant valuations there exists no direct-revelation mechanism that is strategyproof and even approximately proportional. Subsequently, we remove the non-wasteful constraint and show another impossibility result stating that there is no strategyproof and approximately proportional direct-revelation mechanism that outputs contiguous allocations, again, for even the restricted class of piecewise constant valuations. In addition to the above results, we also present some negative results when considering an approximate notion of strategyproofness, show a connection between direct-revelation mechanisms and mechanisms in the Robertson-Webb model when agents have piecewise constant valuations, and finally also present a (minor) modification to the well-known Even-Paz algorithm that has better incentive-compatible properties for the cases when there are two or three agents.


Sign in / Sign up

Export Citation Format

Share Document