Related papers: Limiting search cost distribution for the move-to-…

We study the convergence rate to stationarity for a class of exchangeable partition-valued Markov chains called cut-and-paste chains. The law governing the transitions of a cut-and-paste chain are determined by products of i.i.d. stochastic…

Using simple particle models of limit order markets, we argue that mid-term over-diffusive price behaviour is inherent to the very nature of these markets. Several rules for rate changes are considered. We obtain analytical results for…

In this paper we study the number of key exchanges required by Hoare's FIND algorithm (also called Quickselect) when operating on a uniformly distributed random permutation and selecting an independent uniformly distributed rank. After…

We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighborhood of the root of the tree converges to a limit. We…

List Accessing Problem is a well studied research problem in the context of linear search. Input to the list accessing problem is an unsorted linear list of distinct elements along with a sequence of requests, where each request is an…

Motivated by wide-ranging applications such as video delivery over networks using Multiple Description Codes, congestion control, and inventory management, we study the state-tracking of a Markovian random process with a known transition…

We define a stochastic model of a two-sided limit order book in terms of its key quantities \textit{best bid [ask] price} and the \textit{standing buy [sell] volume density}. For a simple scaling of the discreteness parameters, that keeps…

We study the online fair division problem, where indivisible goods arrive sequentially and must be allocated immediately and irrevocably. Prior work establishes strong impossibility results for approximating classic notions such as…

A version of the secretary problem is considered. The ranks of items, whose values are independent, identically distributed random variables $X_1,X_2,...,X_n$ from a uniform distribution on $[0; 1]$, are observed sequentially by the grader.…

We consider the cost of general orthogonal range queries in random quadtrees. The cost of a given query is encoded into a (random) function of four variables which characterize the coordinates of two opposite corners of the query rectangle.…

This paper analyzes single-item continuous-review inventory models with random supplies in which the inventory dynamic between orders is described by a diffusion process, and a long-term average cost criterion is used to evaluate decisions.…

In the Markov paging model, one assumes that page requests are drawn from a Markov chain over the pages in memory, and the goal is to maintain a fast cache that suffers few page faults in expectation. While computing the optimal online…

We consider a simplified model of the continuous double auction where prices are integers varying from $1$ to $N$ with limit orders and market orders, but quantity per order limited to a single share. For this model, the order process is…

How do cost shocks pass through to prices in markets with price dispersion? We decompose the problem into two layers. In the competition layer, consumers' consideration sets determine equilibrium distributions of normalized margins. In the…

We consider a version of D. Price's model for the growth of a bibliographic network, where in each iteration a constant number of citations is randomly allocated according to a weighted combination of accidental (uniformly distributed) and…

The time it takes the fastest searcher out of $N\gg1$ searchers to find a target determines the timescale of many physical, chemical, and biological processes. This time is called an extreme first passage time (FPT) and is typically much…

We model equilibrium allocations in a distribution network as the solution of a linear program (LP) which minimizes the cost of unserved demands across nodes in the network. The constraints in the LP dictate that once a given node's supply…

Rideshare platforms such as Uber and Lyft dynamically dispatch drivers to match riders' requests. We model the dispatching process in rideshare as a Markov chain that takes into account the geographic mobility of both drivers and riders…

We study a microscopic limit order book model, in which the order dynamics depend on the current best bid and ask price and the current volume density functions, simultaneously, and derive its macroscopic high-frequency dynamics. As opposed…

We consider the problem of performing predecessor searches in a bounded universe while achieving query times that depend on the distribution of queries. We obtain several data structures with various properties: in particular, we give data…