Concavity and Convexity of Order Statistics in Sample Size
We show that the expectation of the $k^{\mathrm{th}}$-order statistic of an i.i.d. sample of size $n$ from a monotone reverse hazard rate (MRHR) distribution is convex in $n$ and that the expectation of the $(n-k+1)^{\mathrm{th}}$-order statistic from a monotone hazard rate (MHR) distribution is concave in $n$ for $n\ge k$. We apply this result to the analysis of independent private value auctions in which the auctioneer faces a convex cost of attracting bidders. In this setting, MHR valuation distributions lead to concavity of the auctioneer's objective. We extend this analysis to auctions with reserve values, in which concavity is assured for sufficiently small reserves or for a sufficiently large number of bidders.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
D-Convexity: A Unified Differentiable Convex Shape Prior via Quasi-Concavity for Data-driven Image Segmentation
Convexity is a fundamental geometric prior that underlies many natural and man-made structures, yet remains challenging to impose effectively in end-to-end trainable segmentation networks. We revisit convexity from a fun…
Image SegmentationGNCGCP - Graduated NonConvexity and Graduated Concavity Procedure
In this paper we propose the Graduated NonConvexity and Graduated Concavity Procedure (GNCGCP) as a general optimization framework to approximately solve the combinatorial optimization problems on the set of partial perm…
Combinatorial OptimizationGraph MatchingTesting Shape Restrictions with Continuous Treatment: A Transformation Model Approach
We propose tests for the convexity/linearity/concavity of a transformation of the dependent variable in a semiparametric transformation model. These tests can be used to verify monotonicity of the treatment effect, or, e…
Saddle Networks: Structure-Preserving Architectures for Convex-Concave Functions
Saddle-point models arise throughout optimization, optimal transport, robust learning, and control. In many applications, the relevant function f(x,y) is convex in x and concave in y, and preserving this geometry is esse…
Stochastic Variance Reduction Methods for Policy Evaluation
Policy evaluation is a crucial step in many reinforcement-learning procedures, which estimates a value function that predicts states' long-term value under a given policy. In this paper, we focus on policy evaluation wit…
Reinforcement LearningReinforcement Learning (RL)