Implementation in multidimensional dichotomous domains
研究了在私有价值和拟线性效用下，多维二分域中确定性占优策略实施问题，提出了生成单调性条件，并应用于单边匹配问题的最优机制设计。
We consider deterministic dominant strategy implementation in multidimensional dichotomous domains in private values and quasi-linear utility setting. In such multidimensional domains, an agent’s type is characterized by a single number, the value of the agent, and a non-empty set of acceptable alternatives. Each acceptable alternative gives the agent utility equal to his value and other alternatives give him zero utility. We identity a new condition, which we call generation monotonicity, that is necessary and sufficient for implementability in any dichotomous domain. If such a domain satisfies a richness condition, then a weaker version of generation monotonicity, which we call 2-generation monotonicity (equivalent to 3-cycle monotonicity), is necessary and sufficient for implementation. We use this result to derive the optimal mechanism in a one-sided matching problem with agents having dichotomous types.