English
Related papers

Related papers: On Infinite Separations Between Simple and Optimal…

200 papers

We consider an optimal stopping problem with n correlated offers where the goal is to design a (randomized) stopping strategy that maximizes the expected value of the offer in the sequence at which we stop. Instead of assuming to know the…

Optimization and Control · Mathematics 2025-07-08 Pieter Kleer , Daan Noordenbos

A unified framework to derive optimized compact schemes for a uniform grid is presented. The optimal scheme coefficients are determined analytically by solving an optimization problem to minimize the spectral error subject to equality…

Numerical Analysis · Mathematics 2019-12-17 Vedang M. Deshpande , Raktim Bhattacharya , Diego A. Donzis

We prove in Theorem $2.2$ that the multiplicatively closed subset generated by at most two elements in the set of natural numbers $\mathbb{N}$ has arbitrarily large gaps by explicitly constructing large integer intervals with known prime…

Number Theory · Mathematics 2019-05-20 C. P. Anil Kumar

We study the revenue performance of sequential posted price mechanisms and some natural extensions, for a general setting where the valuations of the buyers are drawn from a correlated distribution. Sequential posted price mechanisms are…

Computer Science and Game Theory · Computer Science 2015-10-02 Marek Adamczyk , Allan Borodin , Diodato Ferraioli , Bart de Keijzer , Stefano Leonardi

We introduce a dynamic mechanism design problem in which the designer wants to offer for sale an item to an agent, and another item to the same agent at some point in the future. The agent's joint distribution of valuations for the two…

Computer Science and Game Theory · Computer Science 2023-05-22 Christos Papadimitriou , George Pierrakos , Christos-Alexandros Psomas , Aviad Rubinstein

We consider the design of a revenue-optimal mechanism when two items are available to be sold to a single buyer whose valuation is uniformly distributed over an arbitrary rectangle $[c_1,c_1+b_1]\times[c_2,c_2+b_2]$ in the positive…

Computer Science and Game Theory · Computer Science 2019-03-06 D. Thirumulanathan , Rajesh Sundaresan , Y Narahari

Consider a monopolist selling $n$ items to an additive buyer whose item values are drawn from independent distributions $F_1,F_2,\ldots,F_n$ possibly having unbounded support. Unlike in the single-item case, it is well known that the…

Computer Science and Game Theory · Computer Science 2021-04-13 Moshe Babaioff , Yannai A. Gonczarowski , Noam Nisan

Recently, it has been shown constructively how a finite set of hypergeometric products, multibasic hypergeometric products or their mixed versions can be modeled properly in the setting of formal difference rings. Here special emphasis is…

Symbolic Computation · Computer Science 2019-11-13 Carsten Schneider

This article introduces a novel framework for nonparametric priors on real-valued random vectors, which can be viewed as a multivariate generalization of neutral-to-the right priors. It is based on randomizing the exponent measure of a…

Methodology · Statistics 2026-05-13 Florian Brück

Discrete diffusion has become a leading framework for generative modeling in various applications including language, vision, and biology. Existing convergence theory, however, exhibits fundamental limitations. KL-based analyses diverge…

Machine Learning · Computer Science 2026-05-19 Kelvin Kan , Xingjian Li , Benjamin J. Zhang , Tuhin Sahai , Stanley Osher , Markos A. Katsoulakis

We provide a new, much simplified and straightforward proof to a result of Pavlov [2011] regarding the revenue maximizing mechanism for selling two goods with uniformly i.i.d. valuations over intervals $[c,c+1]$, to an additive buyer. This…

Computer Science and Game Theory · Computer Science 2015-10-14 Yiannis Giannakopoulos

Fast, gradient-based structural optimization has long been limited to a highly restricted subset of problems -- namely, density-based compliance minimization -- for which gradients can be analytically derived. For other objective functions,…

Computational Engineering, Finance, and Science · Computer Science 2024-09-17 Keith J. Lee , Yijiang Huang , Caitlin T. Mueller

Abstract separation systems provide a simple general framework in which both tree-shape and high cohesion of many combinatorial structures can be expressed, and their duality proved. Applications range from tangle-type duality and tree…

Combinatorics · Mathematics 2017-04-19 Reinhard Diestel

Let $\mathcal{K}$ be a finite pure simplicial $d$-complex, with oriented facets $\{F_i\}$, which is boundaryless in the sense that $\sum\partial F_i=0$. We call such a $\mathcal{K}$ an \textit{admissible $d$-complex}. Given an admissible…

Algebraic Topology · Mathematics 2024-04-02 Matthew Ellison

This paper reexamines the classic problem of revenue maximization in single-item auctions with $n$ buyers under the lens of the robust optimization framework. The celebrated Myerson's mechanism is the format that maximizes the seller's…

Computer Science and Game Theory · Computer Science 2024-09-16 Nick Gravin , Zhiqi Wang

Distributed model fitting refers to the process of fitting a mathematical or statistical model to the data using distributed computing resources, such that computing tasks are divided among multiple interconnected computers or nodes, often…

Computation · Statistics 2024-06-04 Xiaofei Wu , Rongmei Liang , Fabio Roli , Marcello Pelillo , Jing Yuan

We study multi-item profit maximization when there is an underlying distribution over buyers' values. In practice, a full description of the distribution is typically unavailable, so we study the setting where the mechanism designer only…

Machine Learning · Computer Science 2023-05-09 Maria-Florina Balcan , Tuomas Sandholm , Ellen Vitercik

A fundamental economic question is that of designing revenue-maximizing mechanisms in dynamic environments. This paper considers a simple yet compelling market model to tackle this question, where forward-looking buyers arrive at the market…

Theoretical Economics · Economics 2024-10-16 Jose Correa , Andres Cristi , Laura Vargas Koch

We study a resource allocation setting where $m$ discrete items are to be divided among $n$ agents with additive utilities, and the agents' utilities for individual items are drawn at random from a probability distribution. Since common…

Computer Science and Game Theory · Computer Science 2023-03-20 Pasin Manurangsi , Warut Suksompong

We study martingale inequalities from an analytic point of view and show that a general martingale inequality can be reduced to a pair of deterministic inequalities in a small number of variables. More precisely, the optimal bound in the…

Probability · Mathematics 2014-10-21 Mathias Beiglböck , Marcel Nutz