Related papers: Truthful Bilateral Trade is Impossible even with F…
We provide the first separation in the approximation guarantee achievable by truthful and non-truthful combinatorial auctions with polynomial communication. Specifically, we prove that any truthful mechanism guaranteeing a…
It is well-known that optimal (i.e., revenue-maximizing) selling mechanisms in multidimensional type spaces may involve randomization. We obtain conditions under which deterministic mechanisms are optimal for selling two identical,…
We study the problem of a budget limited buyer who wants to buy a set of items, each from a different seller, to maximize her value. The budget feasible mechanism design problem aims to design a mechanism which incentivizes the sellers to…
Bilateral trade models the task of intermediating between two strategic agents, a seller and a buyer, who wish to trade a good. We study this problem from the perspective of a profit-maximizing broker within an online learning framework,…
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…
We provide sufficient conditions for revenue maximization in a two-good monopoly where the buyer's values for the items come from independent (but not necessarily identical) distributions over bounded intervals. Under certain distributional…
We formulate an equilibrium model of intraday trading in electricity markets. Agents face balancing constraints between their customers consumption plus intraday sales and their production plus intraday purchases. They have continuously…
Why is ``worthless'' fiat money generally accepted as payment for goods and services? In equilibrium theory, the value of money is generally not determined: the number of equations is one less than the number of unknowns, so only relative…
I introduce a stability notion, dynamic stability, for two-sided dynamic matching markets where (i) matching opportunities arrive over time, (ii) matching is one-to-one, and (iii) matching is irreversible. The definition addresses two…
Motivated by many practical applications, in this paper we study {\em budget feasible mechanisms} where the goal is to procure independent sets from matroids. More specifically, we are given a matroid $\mathcal{M}=(E,\mathcal{I})$ where…
In this paper, we study efficiency in truthful auctions via a social network, where a seller can only spread the information of an auction to the buyers through the buyers' network. In single-item auctions, we show that no mechanism is…
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…
We consider the problem of allocating heterogeneous and indivisible goods among strategic agents, with preferences over subsets of goods, when there is no medium of exchange. This model captures the well studied problem of fair allocation…
Many markets rely on traders truthfully communicating who has cheated in the past and ostracizing those traders from future trade. This paper investigates when truthful communication is incentive compatible. We find that if each side has a…
We investigate online pricing in two-sided markets where a platform repeatedly posts prices based on binary accept/reject feedback to maximize gains-from-trade (GFT) or profit. We characterize the regret achievable across three mechanism…
Constrained maximization of submodular functions poses a central problem in combinatorial optimization. In many realistic scenarios, a number of agents need to maximize multiple submodular objectives over the same ground set. We study such…
In the multi-unit pricing problem, multiple units of a single item are for sale. A buyer's valuation for $n$ units of the item is $v \min \{ n, d\} $, where the per unit valuation $v$ and the capacity $d$ are private information of the…
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…
We study the multi-item mechanism design problem where a monopolist sells $n$ heterogeneous items to a single buyer. We focus on buy-many mechanisms, a natural class of mechanisms frequently used in practice. The buy-many property allows…
Recently, a randomized mechanism has been discovered [Dughmi, Roughgarden and Yan; STOC'11] for combinatorial auctions that is truthful in expectation and guarantees a (1-1/e)-approximation to the optimal social welfare when players have…