Related papers: Bilateral parking procedures
Algorithms with (machine-learned) predictions is a powerful framework for combining traditional worst-case algorithms with modern machine learning. However, the vast majority of work in this space assumes that the prediction itself is…
The cluster complex on one hand, parking functions on the other hand, are two combinatorial (po)sets that can be associated to a finite real reflection group. Cluster parking functions are obtained by taking an appropriate fiber product…
We investigate a model for driven exclusion processes where internal states are assigned to the particles. The latter account for diverse situations, ranging from spin states in spintronics to parallel lanes in intracellular or vehicular…
Park-and-ride facilities are car parks where users can transfer to public transportation. Commuters can use P&R facilities or choose to travel by car to their destinations, and individual choice behavior is assumed to follow a logit model.…
This paper studies a generalization of parking functions named $k$-Naples parking functions, where backward movement is allowed. One consequence of backward movement is that the number of ascending $k$-Naples is not the same as the number…
We introduce a new parking procedure called MVP parking in which $n$ cars sequentially enter a one-way street with a preferred parking spot from the $n$ parking spots on the street. If their preferred spot is empty, they park there.…
In sorting situations where the final destination of each item is known, it is natural to repeatedly choose items and place them where they belong, allowing the intervening items to shift by one to make room. (In fact, a special case of…
Motion planning for urban environments with numerous moving agents can be viewed as a combinatorial problem. With passing an obstacle before, after, right or left, there are multiple options an autonomous vehicle could choose to execute.…
The choice titration procedure presents a subject with a repeated choice between a standard option that always provides the same reward and an adjusting option for which the reward schedule is adjusted based on the subjects previous…
In this paper, we shall construct a bijection between rook placements on double staircases (introduced by Josuat-Verg\`es in 2017) and increasing binary trees. We introduce two subclasses of rook placements on double staircases, which we…
Human environments contain numerous objects configured in a variety of arrangements. Our goal is to enable robots to repose previously unseen objects according to learned semantic relationships in novel environments. We break this problem…
The \emph{Shi arrangement} is the set of all hyperplanes in $\mathbb R^n$ of the form $x_j - x_k = 0$ or $1$ for $1 \le j < k \le n$. Shi observed in 1986 that the number of regions (i.e., connected components of the complement) of this…
We apply the power-of-two-choices paradigm to a random walk on a graph: rather than moving to a uniform random neighbour at each step, a controller is allowed to choose from two independent uniform random neighbours. We prove that this…
We study when a multipartite non--local unitary operation can deterministically or probabilistically simulate another one when local operations of a certain kind -in some cases including also classical communication- are allowed. In the…
Making binary decisions is a common data analytical task in scientific research and industrial applications. In data sciences, there are two related but distinct strategies: hypothesis testing and binary classification. In practice, how to…
Parking challenges escalate significantly during large events such as concerts or sports games, yet few studies address dynamic parking lot assignments for such occasions. This paper introduces a smart navigation system designed to optimize…
This paper deals with retraction - intended as isomorphic embedding - in intersection types building left and right inverses as terms of a lambda calculus with a bottom constant. The main result is a necessary and sufficient condition two…
Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We…
A set of probabilistic predictions is well calibrated if the events that are predicted to occur with probability p do in fact occur about p fraction of the time. Well calibrated predictions are particularly important when machine learning…
Heavy traffic congestion daily occurs at merging sections on highway. For releasing this congestion, possibility of alternative configuration of vehicles on multiple-lane road is discussed in this paper. This is the configuration where no…