Ordinally Bayesian Incentive Compatible Stable Matching

Nous étudions des questions d'incitation dans le cadre des problèmes de marriage, en remplassant la notion de non-manipulabilité par celle de Compatibilité Incitative Bayésienne Ordinale (OBIC). Cette condition exige que dire la vérité maximise l'utilité espérée calculée par rapport à la loi a priori de chaque agent et sous l'hypothèse que les autres agents disent la vérité. Nous montrons que, sans restriction sur les préférences, il n'existe aucune procédure stable et OBIC. On suppose ensuite que les préférences sont telles que rester célibataire est la pire option pour chaque agent. Dans ce cas, si les probabilités a priori sont uniformes, les mariages générés par les algorithmes d'acceptation différée sont OBIC. Cependant, pour des lois a priori génériques, il n'existe pas de procédures stables et OBIC, même pour des préférences restreintes.Marriage stable;Incitation;Manipulabilité

Ordinally Bayesian Incentive Compatible Stable Matchings

We study incentive issues related to two-sided one-to-one stable matching problem after weakening the notion of strategy-proofness to Ordinal Bayesian Incentive Compatibility (OBIC). Under OBIC, truthtelling is required to maximize the expected utility of every agent, expected utility being computed with respect to the agent’s prior beliefs and under the assumption that everybody else is also telling the truth. We show that when preferences are unrestricted there exists no matching procedure that is both stable and OBIC. Next preferences are restricted to the case where remaining single is the worst alternative for every agent. We show that in this case, if agents have uniform priors then the stable matchings generated by “deferred acceptance algorithms” are OBIC. However, for generic priors there are no matching procedures that are both stable and OBIC even with restricted preferences.stable matching, incentives, strategy-proofness

Continuity and Incentive Compatibility in Cardinal Voting Mechanisms

We show that every cardinal incentive compatible voting mechanism satisfying a continuity condition, must be ordinal. Our results apply to many standard models in mechanism design without transfers, including the standard voting models with any domain restrictions

The Theory of Implementation of Social Choice Rules

Suppose that the goals of a society can be summarized in a social choice rule, i.e., a mapping from relevant underlying parameters to final outcomes. Typically, the underlying parameters (e.g., individual preferences) are private information to the agents in society. The implementation problem is then formulated: under what circumstances can one design a mechanism so that the private information is truthfully elicited and the social optimum ends up being implemented? In designing such a mechanism, appropriate incentives will have to be given to the agents so that they do not wish to misrepresent their information. The theory of implementation or mechanism design formalizes this “social engineering” problem and provides answers to the question just posed. I survey the theory of implementation in this article, emphasizing the results based on two behavioral assumptions for the agents (dominant strategies and Nash equilibrium). Examples discussed include voting, and the allocation of private and public goods under complete and incomplete information.Implementation Theory, Mechanism Design, Asymmetric Information, Decentralization, Game Theory, Dominance, Nash Equilibrium, Monotonicity

Ordinal Bayesian incentive compatibility in random assignment model

We explore the consequences of weakening the notion of incentive compatibility from strategy-proofness to ordinal Bayesian incentive compatibility (OBIC) in the random assignment model. If the common prior of the agents is a uniform prior, then a large class of random mechanisms are OBIC with respect to this prior -- this includes the probabilistic serial mechanism. We then introduce a robust version of OBIC: a mechanism is locally robust OBIC if it is OBIC with respect all independent priors in some neighborhood of a given independent prior. We show that every locally robust OBIC mechanism satisfying a mild property called elementary monotonicity is strategy-proof. This leads to a strengthening of the impossibility result in Bogomolnaia and Moulin (2001): if there are at least four agents, there is no locally robust OBIC and ordinally efficient mechanism satisfying equal treatment of equals

Ordinally Bayesian incentive-compatible voting schemes

We study strategic voting after weakening the notion of strategy-proofness to Ordinal Bayesian Incentive Compatibility (OBIC). Under OBIC, truthelling is required to maximize the expected utility being computed with respect to the voter's prior beliefs and under the assumption that everybody else is also telling the truth. We show that for a special type of priors i.e., the uniform priors there exists a large class of social choice functions that are OBIC. However, for priors which are generic in the set of independent beliefs a social choice function is OBIC only if it is dictatorial. This result underlines the robustness of the Gibbard-Satterthwaite Theorem.

Optimal Voting Rules

We study dominant strategy incentive compatible (DIC) and deterministic mechanisms in a social choice setting with several alternatives. The agents are privately informed about their preferences, and have single-crossing utility functions. Monetary transfers are not feasible. We use an equivalence between deterministic, DIC mechanisms and generalized median voter schemes to construct the constrained-efficient, optimal mechanism for an utilitarian planner. Optimal schemes for other welfare criteria such as, say, a Rawlsian maximin can be analogously obtained