Related papers: Perturbation-Resilient Trades for Dynamic Service …
Pairs trading is a market-neutral strategy that exploits historical correlation between stocks to achieve statistical arbitrage. Existing pairs-trading algorithms in the literature require rather restrictive assumptions on the underlying…
In this paper we show that when individuals in a bipartite network exclusively choose partners and exchange valued goods with their partners, then there exists a set of exchanges that are pair-wise stable. Pair-wise stability implies that…
In this paper we consider multidimensional mechanism design problem for selling discrete substitutable items to a group of buyers. Previous work on this problem mostly focus on stochastic description of valuations used by the seller.…
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,…
We study a simple exchange model in which price is fixed and the amount of a good transferred between actors depends only on the actors' respective budgets and the existence of a link between transacting actors. The model induces a…
Generally, combinatorial design concerns with the arrangement of a finite set of elements into patterns (subsets, words, arrays) according to specified rules. The usefulness of this design method is that the number of input combination can…
We study mechanism design for combinatorial cost sharing. Imagine that multiple items or services are available to be shared among a set of interested agents. The outcome of a mechanism in this setting consists of an assignment, determining…
A relationally exchangeable structure is a random combinatorial structure whose law is invariant with respect to relabeling its relations, as opposed to its elements. Aside from exchangeable random partitions, examples include edge…
While load balancing in distributed-memory computing has been well-studied, we present an innovative approach to this problem: a unified, reduced-order model that combines three key components to describe "work" in a distributed system:…
Batch codes, introduced by Ishai, Kushilevitz, Ostrovsky and Sahai in [1], are methods for solving the following data storage problem: n data items are to be stored in m servers in such a way that any k of the n items can be retrieved by…
Assortment optimization refers to the problem of designing a slate of products to offer potential customers, such as stocking the shelves in a convenience store. The price of each product is fixed in advance, and a probabilistic choice…
In this paper we provide a comprehensive analysis of a structural model for the dynamics of prices of assets traded in a market originally proposed in [1]. The model takes the form of an interacting generalization of the geometric Brownian…
Weighted reciprocity between two agents can be defined as the minimum of sending and receiving value in their bilateral relationship. In financial networks, such reciprocity characterizes the importance of individual banks as both liquidity…
Bundling, the practice of jointly selling two or more products at a discount, is a widely used strategy in industry and a well examined concept in academia. Historically, the focus has been on theoretical studies in the context of…
This article studies disruption tolerant networks (DTNs) where each node knows the probabilistic distribution of contacts with other nodes. It proposes a framework that allows one to formalize the behaviour of such a network. It generalizes…
We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…
Dynamic pricing schemes were introduced as an alternative to posted-price mechanisms. In contrast to static models, the dynamic setting allows to update the prices between buyer-arrivals based on the remaining sets of items and buyers, and…
This paper studies decentralized re-equilibration following population shocks, such as worker exits or firm entries, in many-to-many matching markets with contracts under substitutable preferences. We show that restricting any pre-shock…
Round-based models are very common message-passing models; combinatorial topology applied to distributed computing provides sweeping results like general lower bounds. We combine both to study the computability of k-set agreement. Among all…
We investigate the general structure of optimal investment and consumption with small proportional transaction costs. For a safe asset and a risky asset with general continuous dynamics, traded with random and time-varying but small…