Showing 1 - 10 of 38
Persistent link: https://www.econbiz.de/10009973909
We study multi-unit auctions for bidders that have a budget constraint, a situation very common in practice that has received relatively little attention in the auction theory literature. Our main result is an impossibility: there is no deterministic auction that (1) is individually rational and...
Persistent link: https://www.econbiz.de/10011049858
Persistent link: https://www.econbiz.de/10009830633
We study environments with m homogenous items and two bidders, where the private information of each bidder consists of a monotone valuation (multi-unit auctions). We analyze ex-post implementable social choice functions where the dominant strategy of a bidder is to reveal his valuation.
Persistent link: https://www.econbiz.de/10011189749
We design two computationally-efficient incentive-compatible mechanisms for combinatorial auctions with general bidder preferences. Both mechanisms are randomized, and are incentive-compatible in the universal sense. This is in contrast to recent previous work that only addresses the weaker...
Persistent link: https://www.econbiz.de/10005596277
Persistent link: https://www.econbiz.de/10005369471
We consider dynamic auction mechanisms for the allocation of multiple items. Items are identical, but have different expiration times, and each item must be allocated before it expires. Buyers are of dynamic nature, and arrive and depart over time. Our goal is to design mechanisms that maximize...
Persistent link: https://www.econbiz.de/10011189758
In an environment with dynamic arrivals of players who wish to purchase only one of multiple identical objects for which they have a private value, we analyze a sequential auction mechanism with an activity rule. If the players play undominated strategies then we are able to bound the efficiency...
Persistent link: https://www.econbiz.de/10011151098
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...
Persistent link: https://www.econbiz.de/10005066762
We characterize dominant-strategy incentive compatibility with multidimensional types. A deterministic social choice function is dominant-strategy incentive compatible if and only if it is weakly monotone (W-Mon). The W-Mon requirement is the following: If changing one agent's type (while...
Persistent link: https://www.econbiz.de/10005231802