We study a combinatorial variant of the classical principal-agent model. In our setting a principal wishes to incentivize a team of strategic agents to exert costly effort on his behalf. Agentsʼ actions are hidden and the principal observes only the outcome of the team, which depends...

We consider the problem of a spatially distributed market with strategic agents. A single good is traded in a set of independent markets, where shipment between markets is possible but costly. The problem has previously been studied in the non-strategic case, in which it can be analyzed and...

We study the equilibria of non-atomic congestion games in which there are two types of players: rational players, who seek to minimize their own delay, and malicious players, who seek to maximize the average delay experienced by the rational players. We study the existence of pure and mixed Nash...

In many economic settings, like spectrum and real-estate auctions, geometric figures on the plane are for sale. Each bidder bids for his desired figure, and the auctioneer has to choose a set of disjoint figures that maximizes the social welfare. In this work, we design mechanisms that are both...

In the presence of self-interested parties, mechanism designers typically aim to implement some social-choice function in an equilibrium. This paper studies the cost of such equilibrium requirements in terms of communication. While a certain amount of information x needs to be communicated just...

We study auctions with additive valuations where agents have a limit on the number of items they may receive. We refer to this setting as capacitated allocation games. We seek truthful and envy free mechanisms that maximize the social welfare. I.e., where agents have no incentive to lie and no...

We quantify the effect of Bayesian ignorance by comparing the social cost obtained in a Bayesian game by agents with local views to the expected social cost of agents having global views. Both benevolent agents, whose goal is to minimize the social cost, and selfish agents, aiming at minimizing...

We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an agent is the distance between its ideal location and the facility. A mechanism maps the locations reported by the agents...

We study envy-free mechanisms for scheduling tasks on unrelated machines (agents) that approximately minimize the makespan. For indivisible tasks, we put forward an envy-free poly-time mechanism that approximates the minimal makespan to within a factor of O(logm), where m is the number of...