Related papers: Generalized permutahedra and optimal auctions
We develop a general duality-theory framework for revenue maximization in additive Bayesian auctions. The framework extends linear programming duality and complementarity to constraints with partial derivatives. The dual system reveals the…
Simultaneous ascending auctions present agents with the exposure problem: bidding to acquire a bundle risks the possibility of obtaining an undesired subset of the goods. Auction theory provides little guidance for dealing with this…
This is a chapter in an upcoming Tamari Festscrift. Permutahedra are a class of convex polytopes arising naturally from the study of finite reflection groups, while generalized associahedra are a class of polytopes indexed by finite…
This paper examines knapsack auctions as a method to solve the knapsack problem with incomplete information, where object values are private and sizes are public. We analyze three auction types-uniform price (UP), discriminatory price (DP),…
Combinatorial auctions are formulated as frustrated lattice gases on sparse random graphs, allowing the determination of the optimal revenue by methods of statistical physics. Transitions between computationally easy and hard regimes are…
We explore the properties of optimal multi-dimensional auctions in a model where a single object of multiple qualities is sold to several buyers. Using simulations, we test some hypotheses conjectured by Belloni et al. [3] and Kushnir and…
In this paper we introduce and study a topological abelian group of convex bodies, analogous to the scissors congruence group and McMullen's polytope algebra, with the universal property that continuous valuations on convex bodies…
We study an abstract optimal auction problem for a single good or service. This problem includes environments where agents have budgets, risk preferences, or multi-dimensional preferences over several possible configurations of the good…
This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…
We introduce and study a family of polytopes which can be seen as a generalization of the permutahedron of type $B_d$. We highlight connections with the largest possible diameter of the convex hull of a set of points in dimension $d$ whose…
We investigate the convex hulls of the eight dihedral symmetry classes of $n \times n$ alternating sign matrices, i.e., ASMs invariant under a subgroup of the symmetry group of the square. Extending the prefix-sum description of the ASM…
The paper studies the problem of auction design in a setting where the auctioneer accesses the knowledge of the valuation distribution only through statistical samples. A new framework is established that combines the statistical decision…
For two families of random polytopes we compute explicitly the expected sums of the conic intrinsic volumes and the Grassmann angles at all faces of any given dimension of the polytope under consideration. As special cases, we compute the…
We prove new general results on sumsets of sets having Szemer\'edi--Trotter type. This family includes convex sets, sets with small multiplicative doubling, images of sets under convex/concave maps and others.
Motivated by the analysis of the performance of the simplex method we study the behavior of families of pivot rules of linear programs. We introduce normalized-weight pivot rules which are fundamental for the following reasons: First, they…
The aim of the paper is to calculate face numbers of simple generalized permutohedra, and study their f-, h- and gamma-vectors. These polytopes include permutohedra, associahedra, graph-associahedra, simple graphic zonotopes, nestohedra,…
Designing an incentive-compatible auction mechanism that maximizes the auctioneer's revenue while minimizes the bidders' ex-post regret is an important yet intricate problem in economics. Remarkable progress has been achieved through…
We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…
An orbit polytope is the convex hull of an orbit under a finite group $G \leq \operatorname{GL}(d,\mathbb{R})$. We develop a general theory of possible affine symmetry groups of orbit polytopes. For every group, we define an open and dense…
Substitute valuations (in some contexts called gross substitute valuations) are prominent in combinatorial auction theory. An algorithm is given in this paper for generating a substitute valuation through Monte Carlo simulation. In…