Related papers: Generalized permutahedra and optimal auctions
We design an expected polynomial-time, truthful-in-expectation, (1-1/e)-approximation mechanism for welfare maximization in a fundamental class of combinatorial auctions. Our results apply to bidders with valuations that are m matroid rank…
We study approximations of smooth convex bodies by random ball-polytopes. We examine the following probability model: let $K\subset{\bf R}^d$ be a convex body such that $K$ slides freely in a ball of radius $R>0$ and has $C^2$ smooth…
We derive simplified sphere-packing and Gilbert--Varshamov bounds for codes in the sum-rank metric, which can be computed more efficiently than previous ones. They give rise to asymptotic bounds that cover the asymptotic setting that has…
In this paper, we present a new model and two mechanisms for auctions in two-sided markets of buyers and sellers, where budget constraints are imposed on buyers. Our model incorporates polymatroidal environments, and is applicable to a wide…
A natural partial ordering exists on the set of all weighted games and, more broadly, on all linear games. We describe several properties of the partially ordered sets formed by these games and utilize this perspective to enumerate proper…
Recently there has been a large amount of research designing mechanisms for auction scenarios where the bidders are connected in a social network. Different from the existing studies in this field that focus on specific auction scenarios…
Luis Ferroni and Alex Fink recently introduced a polytope of all unlabeled matroids of rank $r$ on $n$ elements, and they showed that the vertices of this polytope come from matroids that can be characterized by maximizing a sequence of…
This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same rank, we characterize those whose order polytopes have…
Motivated by applications such as stock exchanges and spectrum auctions, there is a growing interest in mechanisms for arranging trade in two-sided markets. Existing mechanisms are either not truthful, or do not guarantee an…
We apply tropical geometry to study matrix algebras over a field with valuation. Using the shapes of min-max convexity, known as polytropes, we revisit the graduated orders introduced by Plesken and Zassenhaus. These are classified by the…
Contrary to the common view that exact pricing is prohibitive owing to the curse of dimensionality, this study proposes an efficient and unified method for pricing options under multivariate Black-Scholes-Merton (BSM) models, such as the…
It is a sequel to (Wu in arXiv:2003.05187). In that paper, we introduce a notion called modified ideal sheaf in order to make an asymptotic estimate for the order of the cohomology group. Here we continue to a general discussion about this…
The main idea of this note is to describe the integration procedure for poly-Poisson structures, that is, to find a poly-symplectic groupoid integrating a poly-Poisson structure, in terms of topological field theories, namely via the…
An important combinatorial result in equivariant cohomology and $K$-theory Schubert calculus is represented by the formulas of Billey and Graham-Willems for the localization of Schubert classes at torus fixed points. These formulas work…
We compute the volumes of convex bodies that are given by inequalities of concave polynomials. These volumes are found to arbitrary precision thanks to the representation of periods by linear differential equations. Our approach rests on…
This paper describes an optimization model for setting bid levels for certain types of advertisements on web pages. This model is non-convex, but we are able to obtain optimal or near-optimal solutions rapidly using branch and cut…
We prove for the first time that, if a linear inverse problem exhibits a group symmetry structure, gradient-based optimizers can be designed to exploit this structure for faster convergence rates. This theoretical finding demonstrates the…
This paper studies some basic problems in a multiple-object auction model using methodologies from theoretical computer science. We are especially concerned with situations where an adversary bidder knows the bidding algorithms of all the…
The design of revenue-maximizing combinatorial auctions, i.e. multi-item auctions over bundles of goods, is one of the most fundamental problems in computational economics, unsolved even for two bidders and two items for sale. In the…
In this paper, we study the Lie point symmetry group of a system describing an ideal plastic plane flow in two dimensions in order to find analytical solutions. The infinitesimal generators that span the Lie algebra for this system are…