English
Related papers

Related papers: Generalized permutahedra and optimal auctions

200 papers

Continuing a well established tradition of associating convex bodies to monomial ideals, we initiate a program to construct asymptotic Newton polyhedra from decompositions of monomial ideals. This is achieved by forming a graded family of…

In this revised version (August 2025), we add a survey of \infty-categorical (co)limits and a replacement lemma for higher functoriality (Lem. 1.4.5), a framework for explicit models of punctured tubular neighborhoods ({\S}3.4), and a new…

Algebraic Geometry · Mathematics 2025-09-17 Frédéric Déglise , Adrien Dubouloz , Paul Arne Østvær

We study the vertices of the polytopes of all affine maps (a.k.a. hom-polytopes) between higher dimensional simplices, cubes, and crosspolytopes. Systematic study of general hom-polytopes was initiated in [3]. The study of such vertices is…

Combinatorics · Mathematics 2014-03-04 Joseph Gubeladze , Jack Love

We study billiards on polytopes in $\Rr^d$ with contracting reflection laws, i.e. non-standard reflection laws that contract the reflection angle towards the normal. We prove that billiards on generic polytopes are uniformly hyperbolic…

Dynamical Systems · Mathematics 2016-11-08 Pedro Duarte , José Pedro Gaivão , Mohammad Soufi

In this contribution we review some of the interplay between sigma models in theoretical physics and novel geometrical structures such as Lie (n-)algebroids. The first part of the article contains the mathematical background, the definition…

High Energy Physics - Theory · Physics 2010-04-06 A. Kotov , T. Strobl

Sumset estimates, which provide bounds on the cardinality of sumsets of finite sets in a group, form an essential part of the toolkit of additive combinatorics. In recent years, probabilistic or entropic analogs of many of these…

Metric Geometry · Mathematics 2022-06-06 Matthieu Fradelizi , Mokshay Madiman , Artem Zvavitch

This paper initiates a study into the century-old issue of market predictability from the perspective of computational complexity. We develop a simple agent-based model for a stock market where the agents are traders equipped with simple…

Computational Engineering, Finance, and Science · Computer Science 2007-05-23 James Aspnes , David F. Fischer , Michael J. Fischer , Ming-Yang Kao , Alok Kumar

We show that computing the revenue-optimal deterministic auction in unit-demand single-buyer Bayesian settings, i.e. the optimal item-pricing, is computationally hard even in single-item settings where the buyer's value distribution is a…

Computer Science and Game Theory · Computer Science 2015-03-10 Constantinos Daskalakis , Alan Deckelbaum , Christos Tzamos

This book introduces a new context for global homotopy theory, i.e., equivariant homotopy theory with universal symmetries. Many important equivariant theories naturally exist not just for a particular group, but in a uniform way for all…

Algebraic Topology · Mathematics 2020-01-13 Stefan Schwede

Groups $\Pi_k(X;\sigma)$ of "flagged homotopies" are introduced of which the usual (abelian for $k>1$) homotopy groups $\pi_k(X;p)$ is the limit case for flags $\sigma$ contracted to a point $p$. Calculus of exterior forms with values in…

Geometric Topology · Mathematics 2007-05-23 Valery V. Dolotin

In a recent and ongoing work, Baldwin and Klemperer explored a connection between tropical geometry and economics. They gave a sufficient condition for the existence of competitive equilibrium in product-mix auctions of indivisible goods.…

Computer Science and Game Theory · Computer Science 2017-10-26 Ngoc Mai Tran , Josephine Yu

In this paper we combine methods from additive combinatorics and Diophantine geometry to study the generalised sum-product phenomenon in algebraic groups. As an application of this circle of ideas, we resolve a conjecture of Bremner on…

Number Theory · Mathematics 2026-03-09 Joseph Harrison , Akshat Mudgal , Harry Schmidt

We study a sequential decision-making model where a set of items is repeatedly matched to the same set of agents over multiple rounds. The objective is to determine a sequence of matchings that either maximizes the utility of the least…

Computer Science and Game Theory · Computer Science 2025-10-07 Eugene Lim , Tzeh Yuan Neoh , Nicholas Teh

Some important classical mechanisms considered in Microeconomics and Game Theory require the solution of a difficult optimization problem. This is true of mechanisms for combinatorial auctions, which have in recent years assumed practical…

Computer Science and Game Theory · Computer Science 2007-05-23 Daniel Lehmann , Liadan Ita O'Callaghan , Yoav Shoham

New lower bounds involving sum, difference, product, and ratio sets for a set $A\subset \C$ are given. The estimates involving the sum set match, up to constants, the one obtained by Solymosi for the reals and are obtained by generalising…

Combinatorics · Mathematics 2013-03-12 Sergei V. Konyagin , Misha Rudnev

Numerical homotopy continuation methods for three classes of polynomial systems are presented. For a generic instance of the class, every path leads to a solution and the homotopy is optimal. The counting of the roots mirrors the resolution…

Numerical Analysis · Mathematics 2025-10-20 Jan Verschelde

Symplectic resolutions are an exciting new frontier of research in representation theory. One of the most fascinating aspects of this study is symplectic duality: the observation that these resolutions come in pairs with matching…

Representation Theory · Mathematics 2022-04-28 Joel Kamnitzer

In this article, we survey the the recent literature surrounding the geometry of complex polynomials. Specific areas surveyed are i) Generalizations of the Gauss--Lucas Theorem, ii) Geometry of Polynomials Level Sets, and iii) Shape…

Complex Variables · Mathematics 2020-01-14 Trevor J. Richards

Lie symmetry group method is applied to study for the higher order Camassa-Holm equation. The symmetry group and its optimal system are given. Furthermore, preliminary classification of its group invariant solutions, symmetry reduction and…

Analysis of PDEs · Mathematics 2011-11-23 Mehdi Nadjafikhah , Vahid Shirvani-Sh

Traditional combinatorial spectrum auctions mainly rely on fixed bidding and matching processes, which limit participants' ability to adapt their strategies and often result in suboptimal social welfare in dynamic spectrum sharing…

Computer Science and Game Theory · Computer Science 2025-07-29 Xiang Shao , Wei Wang , Guan Gui
‹ Prev 1 8 9 10 Next ›