Consider a social choice setting in which agents have quasilinear utilities over monetary transfers. A domain D of admissible valuation functions of an agent is called a revenue monotonicity domain if every 2-cycle monotone allocation rule is truthfully implementable (in dominant strategies) and...

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...

We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume a strategic setting, where the data of each job j, namely its release date r(j) , its processing time p(j) and its weight w(j) is only...

In this paper we present a new iterative auction, the bisection auction, that can be used for the sale of a single indivisable object. We will show that the bisection auction is computationally more efficient than the classical English auction while it still preserves all characteristics the...

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...

In this paper, we survey different models, techniques, and some recent results to tackle machine scheduling problems within a distributed setting. In traditional optimization, a central authority is asked to solve a (computationally hard) optimization problem. In contrast, in distributed...

We study the problem of finding the profit-maximizing mechanism for a monopolistic provider of a single, non-excludable public good. Our model covers the most general setting, namely, we allow for correlation in the signal distribution as well as for informational externalities in the...

This paper studies the sales of a single indivisible object where bidders have continuous valuations. In Grigorieva et al. [14] it was shown that, in this setting, query auctions necessarily allocate inefficiently in equilibrium. In this paper we propose a new sequential auction, called the...

A digital mechanism is defined as an iterative procedure in which bidders select an action, from a finite set, in each iteration. When bidders have continuous valuations and make strategic reports, we show that any ex post implementation of the Vickrey choice rule via such a mechanism needs...

In this paper we present a new auction, the bisection auction, that can be used for the sale of a single indivisible object. We discuss the issue concerning the information revelation requirement of this auction and the associated amount of data that needs to be transmitted. We show that in the...