Related papers: Multi-to -one dimensional and semi-discrete screen…
We study the following distribution clustering problem: Given a hidden partition of $k$ distributions into two groups, such that the distributions within each group are the same, and the two distributions associated with the two clusters…
Clustering is a well-known unsupervised machine learning approach capable of automatically grouping discrete sets of instances with similar characteristics. Constrained clustering is a semi-supervised extension to this process that can be…
We study procurement design when the buyer is uncertain about both the value of the good and the seller's cost. The buyer has a conjectured model but does not fully trust it. She first identifies mechanisms that maximize her worst-case…
We consider the discrete assignment problem in which agents express ordinal preferences over objects and these objects are allocated to the agents in a fair manner. We use the stochastic dominance relation between fractional or randomized…
We characterize when a coherent state or continuous frame for a Hilbert space may be sampled to obtain a frame, which solves the discretization problem for continuous frames. In particular, we prove that every bounded continuous frame for a…
Economic institutions often influence market outcomes not by directly controlling sellers' menus, but by shaping the market composition sellers face. We study the welfare effects of this upstream choice in a monopoly screening model. An…
We study distribution testing in the standard access model and the conditional access model when the memory available to the testing algorithm is bounded. In both scenarios, the samples appear in an online fashion and the goal is to test…
We use the generalized concurrence approach to investigate the general multipartite separability problem. By extending the preconcurrence matrix formalism to arbitrary multipartite systems, we show that the separability problem can be…
We explore the structure of multipartite quantum systems which are entangled in multiple degrees of freedom. We find necessary and sufficient conditions for the characterization of tripartite systems and necessary conditions for any number…
We study the problem of assigning indivisible objects to agents where each is to receive at most one. To ensure fairness in the absence of monetary compensation, we consider random assignments. Random Priority, also known as Random Serial…
Symmetries in discrete constraint satisfaction problems have been explored and exploited in the last years, but symmetries in continuous constraint problems have not received the same attention. Here we focus on permutations of the…
Algorithmic recommender systems such as Spotify and Netflix affect not only consumer behavior but also producer incentives. Producers seek to create content that will be shown by the recommendation algorithm, which can impact both the…
A monopolistic seller aims to sell an indivisible item to multiple potential buyers. Each buyer's valuation depends on their private type and the item's quality. The seller can observe the quality but it is unknown to buyers. This quality…
We study the multi-item mechanism design problem where a monopolist sells $n$ heterogeneous items to a single buyer. We focus on buy-many mechanisms, a natural class of mechanisms frequently used in practice. The buy-many property allows…
We study a robust selling problem where a seller attempts to sell one item to a buyer but is uncertain about the buyer's valuation distribution. Existing literature shows that robust screening provides a stronger theoretical guarantee than…
We consider a revenue-maximizing seller with $n$ items facing a single buyer. We introduce the notion of symmetric menu complexity of a mechanism, which counts the number of distinct options the buyer may purchase, up to permutations of the…
We study the problem of constructing a probability density in 2N-dimensional phase space which reproduces a given collection of $n$ joint probability distributions as marginals. Only distributions authorized by quantum mechanics, i.e.…
We present a general analysis of multidimensional matching problems with transferable utility, paying particular attention to the case in which the dimensions of heterogeneity on the two sides of the market are unequal. A particular…
Assortment optimization is a critical tool for online retailers aiming to maximize revenue. However, optimizing purely for revenue can lead to unbalanced sales across products, potentially causing a long tail of low-selling products and…
We study undominated mechanisms with transfers for regulating a monopolist who privately observes the marginal cost of production. We show that in any undominated mechanism, there is a quantity floor, which depends only on the primitives,…