Related papers: Knightian Analysis of the Vickrey Mechanism
We study single-good auctions in a setting where each player knows his own valuation only within a constant multiplicative factor \delta{} in (0,1), and the mechanism designer knows \delta. The classical notions of implementation in…
We consider auctions in which the players have very limited knowledge about their own valuations. Specifically, the only information that a Knightian player $i$ has about the profile of true valuations, $\theta^*$, consists of a set of…
We are interested in mechanisms that maximize social welfare. In [1] this problem was studied for multi-unit auctions with unit demand bidders and for the public project problem, and in each case social welfare undominated mechanisms in the…
We consider auctions in which the players have very limited knowledge about their own valuations. Specifically, the only information that a Knightian player $i$ has about the profile of true valuations, $\theta^*$, consists of a set of…
Consider the problem of allocating goods to buyers through an auction. An auction is efficient if the resulting allocation maximizes total welfare, conditional on the information available. If buyers have private values, the…
Auction is the common paradigm for resource allocation which is a fundamental problem in human society. Existing research indicates that the two primary objectives, the seller's revenue and the allocation efficiency, are generally…
We consider two sided matching markets consisting of agents with non-transferable utilities; agents from the opposite sides form matching pairs (e.g., buyers-sellers) and negotiate the terms of their math which may include a monetary…
In the private values single object auction model, we construct a satisfactory mechanism - a symmetric, dominant strategy incentive compatible, and budget-balanced mechanism. Our mechanism allocates the object to the highest valued agent…
When agents with independent priors bid for a single item, Myerson's optimal auction maximizes expected revenue, whereas Vickrey's second-price auction optimizes social welfare. We address the natural question of trade-offs between the two…
We present our results on Uniform Price Auctions, one of the standard sealed-bid multi-unit auction formats, for selling multiple identical units of a single good to multi-demand bidders. Contrary to the truthful and economically efficient…
Under the incentive-compatible Vickrey-Clarke-Groves mechanism, coalitions of participants can influence the auction outcome to obtain higher collective profit. These manipulations were proven to be eliminated if and only if the market…
We study auctions with additive valuations where agents have a limit on the number of goods they may receive. We refer to such valuations as {\em capacitated} and seek mechanisms that maximize social welfare and are simultaneously incentive…
We reconsider the microeconomic foundations of financial economics. Motivated by the importance of Knightian Uncertainty in markets, we present a model that does not carry any probabilistic structure ex ante, yet is based on a common order.…
From social networks to supply chains, more and more aspects of how humans, firms and organizations interact is mediated by artificial learning agents. As the influence of machine learning systems grows, it is paramount that we study how to…
We study the mechanism design problem of selling $k$ items to unit-demand buyers with private valuations for the items. A buyer either participates directly in the auction or is represented by an intermediary, who represents a subset of…
We study the design of efficient mechanisms under asymmetric awareness and information. Unawareness refers to the lack of conception rather than the lack of information. Assuming quasi-linear utilities and private values, we show that we…
We study the problem of designing optimal auctions under restrictions on the set of permissible allocations. In addition to allowing us to restrict to deterministic mechanisms, we can also indirectly model non-additive valuations. We prove…
A common objective in mechanism design is to choose the outcome (for example, allocation of resources) that maximizes the sum of the agents' valuations, without introducing incentives for agents to misreport their preferences. The class of…
A major achievement of mechanism design theory is a general method for the construction of truthful mechanisms called VCG (Vickrey, Clarke, Groves). When applying this method to complex problems such as combinatorial auctions, a difficulty…
Multi-unit auctions are a paradigmatic model, where a seller brings multiple units of a good, while several buyers bring monetary endowments. It is well known that Walrasian equilibria do not always exist in this model, however compelling…