Ensuring Trust in One Time Exchanges: Solving the QoS Problem

We describe a pricing structure for the provision of IT services that ensures trust without requiring repeated interactions between service providers and users. It does so by offering a pricing structure that elicits truthful reporting of quality of service (QoS) by providers while making them profitable. This mechanism also induces truth-telling on the part of users reserving the service

Computational Mechanism Design: A Call to Arms

Game theory has developed powerful tools for analyzing decision making in systems with multiple autonomous actors. These tools, when tailored to computational settings, provide a foundation for building multiagent software systems. This tailoring gives rise to the field of computational mechanism design, which applies economic principles to computer systems design

Trust-Based Mechanisms for Robust and Efficient Task Allocation in the Presence of Execution Uncertainty

Vickrey-Clarke-Groves (VCG) mechanisms are often used to allocate tasks to selfish and rational agents. VCG mechanisms are incentive-compatible, direct mechanisms that are efficient (i.e. maximise social utility) and individually rational (i.e. agents prefer to join rather than opt out). However, an important assumption of these mechanisms is that the agents will always successfully complete their allocated tasks. Clearly, this assumption is unrealistic in many real-world applications where agents can, and often do, fail in their endeavours. Moreover, whether an agent is deemed to have failed may be perceived differently by different agents. Such subjective perceptions about an agent’s probability of succeeding at a given task are often captured and reasoned about using the notion of trust. Given this background, in this paper, we investigate the design of novel mechanisms that take into account the trust between agents when allocating tasks. Specifically, we develop a new class of mechanisms, called trust-based mechanisms, that can take into account multiple subjective measures of the probability of an agent succeeding at a given task and produce allocations that maximise social utility, whilst ensuring that no agent obtains a negative utility. We then show that such mechanisms pose a challenging new combinatorial optimisation problem (that is NP-complete), devise a novel representation for solving the problem, and develop an effective integer programming solution (that can solve instances with about 2×105 possible allocations in 40 seconds).

Mediation, arbitration and negotiation

We compare three common dispute resolution processes { negotiation, mediation, and arbitration { in the framework of Crawford and Sobel (1982). Under negotiation, the two parties engage in (possibly arbitrarily long) face-to-face cheap talk. Under mediation, the parties communicate with a neutral third party who makes a non-binding recommendation. Under arbitration, the two parties commit to conform to the third party recommendation. We characterize and compare the optimal mediation and arbitration procedures. Both mediators and arbitrators should optimally filter information, but mediators should also add noise to it. We find that unmediated negotiation performs as well as mediation if and only if the degree of conflict between the parties is low

Auditing and property rights

This is the official published version. Copyright @ 2004 RANDThird-party audit provides incentives to an agent whose actions affect the value of an asset. When audit intensity and outcome are unverifiable, we show that with interim-participation constraints the optimal mechanism may use only the auditor's report, disregarding the agent's information. Furthermore, the auditor obtains the asset and the agent a monetary compensation, when a high asset value is reported. This suggests regulating renewable resources or utility networks by giving entrants the option to buy the right to use the asset at a predetermined price, and financially rewarding incumbents for good performance.The second author used financial support of the Communaute francaise de Belgique (projet ARC 98/03-221) and EU TMR Network contract no. FMRX-CT98-0203

Private Enforcement against Collusion in Mechanism Design

This paper brings a new point of view into the theory of collusion-proof mechanism design, which highlights the principle of divide and conquer. We relax the restriction of publicly enforced grand contract in the framework of Laffont-Martimort-Itoh, which allows us to incorporate the approach of private enforcement into the theory. In a setting of moral hazard with mutually observable actions, we develop a multi-stage mechanism integrated with secret reporting and private transferring and show that the first-best allocation can be implememted in spite of collusion, which implies that preventing collusion entails no cost under new approach.secret report; private enforcement; collusion-proof mechanism design

A unified approach to the revelation of public goods preferences and to optimal income taxation

We study a large economy model in which individuals have private information about their productive abilities and their preferences for public goods. A mechanism design approach is used to characterize implementable tax and expenditure policies. A robustness requirement in the sense of Bergemann and Morris (2005) yields individual incentive compatibility constraints that are equivalent to those in the theory of optimal income taxation in the tradition of Mirrlees (1971). Adding a requirement of coalition-proofness yields a set of collective incentive conditions which are akin those in the literature on public goods provision under private information on preferences, in the tradition of Clarke (1971) and Groves (1973).Optimal Taxation, Public goods provision, Revelation of Preferences, Robust Mechanism Design

Core-stable Rings in Second Price Auctions with Common Values

In a common value auction in which the information partitions of the bidders are connected, all rings are core-stable. More precisely, the ex ante expected utilities of rings, at the (noncooperative) sophisticated equilibrium proposed by Einy, Haimanko, Orzach and Sela (Journal of Mathematical Economics, 2002), describe a cooperative game, in characteristic function form, in spite of the underlying strategic externalities. A ring is core-stable if the core of this characteristic function is not empty. Furthermore, every ring can implement its sophisticated equilibrium strategy by means of an incentive compatible mechanism.Auctions, Bayesian Game, Collusion, Core, Partition Form Game, Characteristic Function

Arbitration, Mediation and Cheap Talk

Consider an agent (manager,artist, etc.) who has imperfect private information about his productivity. At the beginning of his career (period 1, “short run”), the agent chooses among publicly observable actions that generate imperfect signals of his productivity. The actions can be ranked according to the informativeness of the signals they generate. The market observes the agent’s action and the signal generated by it, and pays a wage equal to his expected productivity. In period 2 (the “long run”), the agent chooses between a constant payoff and a wage proportional to his true productivity, and the game ends. We show that in any equilibrium where not all types of the agent choose the same action, the average productivity of an agent choosing a less informative action is greater. However, the types choosing that action are not uniformly higher. In particular, we derive conditions for the existence of a tripartite equilibrium where low and high types pool on a less informative action while medium (on average, lower) types choose to send a more informative signal.signalling, career concerns