Related papers: Fixed-price Diffusion Mechanism Design
Mobile data demand is increasing tremendously in wireless social networks, and thus an efficient pricing scheme for social-enabled services is urgently needed. Though static pricing is dominant in the actual data market, price intuitively…
I consider a mechanism design problem of selling multiple goods to multiple bidders when the designer has minimal amount of information. I assume that the designer only knows the upper bounds of bidders' values for each good and has no…
We describe here a structured system for distributed mechanism design appropriate for both Intranet and Internet applications. In our approach the players dynamically form a network in which they know neither their neighbours nor the size…
We provide a characterization of revenue-optimal dynamic mechanisms in settings where a monopolist sells k items over k periods to a buyer who realizes his value for item i in the beginning of period i. We require that the mechanism…
Standard procurement models assume that the buyer knows the quality of the good at the time of procurement; however, in many settings, the quality is learned only long after the transaction. We study procurement problems in which the…
We obtain revenue guarantees for the simple pricing mechanism of a single posted price, in terms of a natural parameter of the distribution of buyers' valuations. Our revenue guarantee applies to the single item n buyers setting, with…
We consider the problem of an auctioneer who faces the task of selling a good (drawn from a known distribution) to a set of buyers, when the auctioneer does not have the capacity to describe to the buyers the exact identity of the good that…
We study a mechanism design problem where a seller aims to allocate a good to multiple bidders, each with a private value. The seller supports or favors a specific group, referred to as the minority group. Specifically, the seller requires…
A multi-product monopolist faces a buyer who is privately informed about his valuations for the goods. As is well-known, optimal mechanisms are in general complicated, while simple mechanisms -- such as pure bundling or separate sales --…
Aiming to overcome some of the limitations of worst-case analysis, the recently proposed framework of "algorithms with predictions" allows algorithms to be augmented with a (possibly erroneous) machine-learned prediction that they can use…
We study a dynamic market setting where an intermediary interacts with an unknown large sequence of agents that can be either sellers or buyers: their identities, as well as the sequence length $n$, are decided in an adversarial, online…
A seller chooses a reserve price in a second-price auction to maximize worst-case expected revenue when she knows only the mean of value distribution and an upper bound on either values themselves or variance. Values are private and iid.…
In recent years, many new and interesting models of successful online business have been developed. Many of these are based on the competition between users, such as online auctions, where the product price is not fixed and tends to rise.…
In societal-scale infrastructures, such as electric grids or transportation networks, pricing mechanisms are often used as a way to shape users' demand in order to lower operating costs and improve reliability. Existing approaches to…
Unexpected advertising items in sponsored search may reduce users' reliance on organic search, resulting in hidden cost for the e-commerce platform. To address this problem and promote sustainable growth, we propose a dynamic reserve price…
Auctions have been proposed as a way to provide economic incentives for primary users to dynamically allocate unused spectrum to other users in need of it. Previously proposed schemes do not take into account the fact that the power…
In today's economy, selling a new zero-marginal cost product is a real challenge, as it is difficult to determine a product's "correct" sales price based on its profit and dissemination. As an example, think of the price of a new app or…
In this paper we introduce a class of information-based models for the pricing of fixed-income securities. We consider a set of continuous- time information processes that describe the flow of information about market factors in a monetary…
We consider the problem of a revenue-maximizing seller with m items for sale to n additive bidders with hard budget constraints, assuming that the seller has some prior distribution over bidder values and budgets. The prior may be…
Single-shot auctions are commonly used as a means to sell goods, for example when selling ad space or allocating radio frequencies, however devising mechanisms for auctions with multiple bidders and multiple items can be complicated. It has…