Robust screening under ambiguity
Pınar, M. Ç.
273 - 299
Item Usage Stats
MetadataShow full item record
We consider the problem of screening where a seller puts up for sale an indivisible good, and a buyer with a valuation unknown to the seller wishes to acquire the good. We assume that the buyer valuations are represented as discrete types drawn from some distribution, which is also unknown to the seller. The seller is averse to possible mis-specification of types distribution, and considers the unknown type density as member of an ambiguity set and seeks an optimal pricing mechanism in a worst case sense. We specify four choices for the ambiguity set and derive the optimal mechanism in each case.
Published Version (Please cite this version)http://dx.doi.org/10.1007/s10107-016-1063-x
Showing items related by title, author, creator and subject.
Rudloff, B.; Ulus, F.; Vanderbei, R. (Springer, 2017)In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective simplex (the Evans–Steuer) algorithm (Math ...
Optimal signaling and detector design for power constrained on-off keying systems in Neyman-Pearson framework Dulek, Berkan; Gezici, Sinan (IEEE, 2011)Optimal stochastic signaling and detector design are studied for power constrained on-off keying systems in the presence of additive multimodal channel noise under the Neyman-Pearson (NP) framework. The problem of jointly ...
Çetin, A. Enis; Bozkurt, Alican; Günay, Osman; Habiboglu, Yusuf Hakan; Köse, K.; Onaran, İbrahim; Tofighi, Mohammad; Sevimli, Rasim Akın (IEEE, 2013)A new optimization technique based on the projections onto convex space (POCS) framework for solving convex and some non-convex optimization problems are presented. The dimension of the minimization problem is lifted by ...