English
Related papers

Related papers: $k$th price auctions and Catalan numbers

200 papers

We define a new generalization of Catalan numbers to multinomial coefficients. With arithmetic methods, we study their integrality and the integrality of their Lucasnomial generalization. We give a complete characterization of regular Lucas…

Number Theory · Mathematics 2024-10-08 Joaquim Cera Da Conceição

We study a class of iterative combinatorial auctions which can be viewed as subgradient descent methods for the problem of pricing bundles to balance supply and demand. We provide concrete convergence rates for auctions in this class,…

Computer Science and Game Theory · Computer Science 2016-06-01 Jacob Abernethy , Sébastien Lahaie , Matus Telgarsky

Easily computable lower and upper bounds are found for the sum of Catalan numbers. The lower bound is proven to be tighter than the upper bound, which previously was declared to be only an asymptotic. The average of these bounds is proven…

Combinatorics · Mathematics 2016-03-22 Kevin Topley

We give a new proof of the $k$-fold convolution of the Catalan numbers. This is done by enumerating a certain class of polygonal dissections called $k$-in-$n$ dissections. Furthermore, we give a formula for the average number of cycles in a…

Combinatorics · Mathematics 2011-09-06 Alon Regev

It has been previously noted that optimization of the n-call@k relevance objective (i.e., a set-based objective that is 1 if at least n documents in a set of k are relevant, otherwise 0) encourages more result set diversification for…

Information Retrieval · Computer Science 2016-09-22 Kar Wai Lim , Scott Sanner , Shengbo Guo

Investigating potential purchases is often a substantial investment under uncertainty. Standard market designs, such as simultaneous or English auctions, compound this with uncertainty about the price a bidder will have to pay in order to…

Computer Science and Game Theory · Computer Science 2016-12-22 Robert Kleinberg , Bo Waggoner , E. Glen Weyl

In this (mostly expository) paper I want to share some observations prompted by a class of matrices whose determinants are Catalan numbers. Considering different methods of proof we obtain some generalizations and q-analogues and…

Combinatorics · Mathematics 2019-05-03 Johann Cigler

We address auctions in two-sided markets with budget constraints on buyers, a fundamental setting also crucial for applications such as display advertising. Our goal is to design efficient mechanisms that satisfy dominant strategy incentive…

Computer Science and Game Theory · Computer Science 2024-11-05 Ryosuke Sato

First price auctions are widely used in government contracts and industrial auctions. In this paper, we consider the Bayesian Nash Equilibrium (BNE) in first price auctions with discrete value distributions. We study the characterization of…

Computer Science and Game Theory · Computer Science 2019-07-10 Weiran Shen , Zihe Wang , Song Zuo

Quasiliearity is a ubiquitous and questionable assumption in the standard study of Walrasian equilibria. Quasilinearity implies that a buyer's value for goods purchased in a Walrasian equilibrium is always additive with goods purchased with…

Computer Science and Game Theory · Computer Science 2016-06-23 Rad Niazadeh , Christopher Wilkens

In this work, we consider a class of substitutions on infinite alphabets and show that they exhibit a growth behaviour which is impossible for substitutions on finite alphabets. While for both settings the leading term of the tile counting…

Combinatorics · Mathematics 2023-03-14 Dirk Frettlöh , Alexey Garber , Neil Mañibo

Let $K$ be a number field and $k\geq 2$ be an integer. Let $(n_1,n_2, \dots, n_k)$ be a vector with entries $n_i\in \mathbb{Z}_{\geq 2}$. Given a number field extension $L/K$, we denote by $\widetilde{L}$ the Galois closure of $L$ over $K$.…

Number Theory · Mathematics 2023-07-10 Hrishabh Mishra , Anwesh Ray

We consider a package assignment problem with multiple units of indivisible items. The seller can specify preferences over partitions of their supply between buyers as packaging costs. We propose incremental costs together with a graph that…

Theoretical Economics · Economics 2025-07-08 Simon Finster

This paper analyzes individually-rational ex post equilibrium in the VC (Vickrey-Clarke) combinatorial auctions. If $\Sigma$ is a family of bundles of goods, the organizer may restrict the participants by requiring them to submit their bids…

Computer Science and Game Theory · Computer Science 2007-05-23 Ron Holzman , Noa Kfir-Dahav , Dov Monderer , Moshe Tennenholtz

We study the inefficiency of mixed equilibria, expressed as the price of anarchy, of all-pay auctions in three different environments: combinatorial, multi-unit and single-item auctions. First, we consider item-bidding combinatorial…

Computer Science and Game Theory · Computer Science 2015-08-06 George Christodoulou , Alkmini Sgouritsa , Bo Tang

Implementing a set of microeconomic criteria, we develop price dynamics equations using a function of demand/supply with key symmetry properties. The function of demand/supply can be linear or nonlinear. The type of function determines the…

Mathematical Finance · Quantitative Finance 2019-04-02 Carey Caginalp , Gunduz Caginalp

We define the notion of a Catalan pair (which is a pair of binary relations (S,R) satisfying certain axioms) with the aim of giving a common language to most of the combinatorial interpretations of Catalan numbers. We show, in particular,…

Combinatorics · Mathematics 2009-01-23 Filippo Disanto , Luca Ferrari , Renzo Pinzani , Simone Rinaldi

Online auctions have expanded rapidly over the last decade and have become a fascinating new type of business or commercial transaction in this digital era. Here we introduce a master equation for the bidding process that takes place in…

Physics and Society · Physics 2009-11-11 I. Yang , B. Kahng

We show that recent determinant evaluations involving Catalan numbers and generalisations thereof have most convenient explanations by combining the Lindstr\"om-Gessel-Viennot theorem on non-intersecting lattice paths with a simple…

Combinatorics · Mathematics 2010-04-27 Christian Krattenthaler

We prove exact asymptotic expansions for the partial sums of the sequences of central binomial coefficients and Catalan numbers, $\sum_{k=0}^n \binom{2k}{k}$ and $\sum_{k=0}^n C_n$. We also obtain closed forms for the polynomials…

Combinatorics · Mathematics 2010-01-13 Sandro Mattarei
‹ Prev 1 4 5 6 7 8 10 Next ›