This paper provides a characterization of dominant strategy mechanisms with quasi-linear utilities and multi-dimensional types for a variety of preference domains. These characterizations are in terms of a monotonicity property on the underlying allocation rule.

The property of an allocation rule to be implementable in dominant strategies by a unique payment scheme is called revenue equivalence. In this paper we give a characterization of revenue equivalence based on a graph theoretic interpretation of the incentive compatibility constraints. The...

Lacking payment systems become a bottleneck for the vision of the Information Economy. In many cases payments of fractions of a cent, so-called micropayments, are of particular interest. In this paper we propose a framework to evaluate payment systems. The framework consists of a well structured...

The paper investigates whether Internet experiments are an appropriate alternative to traditional laboratory experiments. For an economic experiment of individual decision making results obtained over the Internet are compared to results obtained in the laboratory using exactly the same...

Auctions are probably the most important mechanism for dynamic pricing in electronic commerce. Although they constitute a very old mechanism as well, the new popularity has raisen a lot of questions on the appropriate design of an auction mechanism for a particular situation. This chapter...

The Application Service Provider (ASP) market leads to rapidly increasing numbers of sites that offer software as an online service, rather than for download and installation. This creates a demand for intelligent solutions to retrieve the best service to resolve the user''s problem. This paper...

An allocation rule is called Bayes-Nash incentive compatible, if there exists a payment rule, such that truthful reports of agents’ types form a Bayes-Nash equilibrium in the directrevelation mechanism consisting of the allocation rule and the payment rule. This paperprovides characterizations...

The paper introduces a model for online parallel machine scheduling, where any single machine is run on the basis of a locally optimal sequencing policy. Jobs choose the machine on which they want to be processed themselves, and in addition, any job owns a piece of private information, namely...

Much of the information available on theWorldWideWeb cannot effectively be found by the help of search engines because the information is dynamically generated on a user’s request.This applies to online decision support services as well as Deep Web information. We present in this paper a...