We consider the makespan-minimization problem on unrelated machines in the context of algorithmic mechanism design. No truthful mechanisms with non-trivial approximation guarantees are known for this multidimensional domain. We study a well-motivated special case (also a multidimensional...

We analyze a simultaneous ascending auction with anonymous item prices, for two items that are substitutes. This popular format entails increased opportunities for coordination among bidders, since bids are observable and can be used as signaling. This has happened, e.g., in the Netherlands 3G...

When attempting to design a truthful mechanism for a computationally hard problem such as combinatorial auctions, one is faced with the problem that most efficiently computable heuristics can not be embedded in any truthful mechanism (e.g. VCG-like payment rules will not ensure truthfulness). We...

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