One-Sided Selfish Parking
نویسندگان
چکیده
The present paper considers a discrete analog of the parking problem. Let n be an integer. If > 1, then we randomly locate interval (t, t + 1) with integer endpoints on segment [0, n]. Thus, original is divided into two: t] and [t n], each them further considered separately likewise one. phrase “randomly” in this problem means that uniformly distributed set {1, . , − 1} random variable. process location intervals finishes when lengths all remaining are less than 2. Define as Xn total amount located intervals. In paper, expectations {Xn} calculated. described above can interpreted cars handlebars left. Hence, driver able to leave his car only if place left free. This exactly case cannot take end any free segment. case, stands for parked cars.
منابع مشابه
One-Sided Interval Trees
We give an alternative treatment and extension of some results of Itoh and Mahmoud on one-sided interval trees. The proofs are based on renewal theory, including a case with mixed multiplicative and additive renewals.
متن کاملOn one-sided versus two-sided classification
One-sided classiiers are computable devices which read the characteristic function of a set and output a sequence of guesses which converges to 1 ii the set on the input belongs to the given class. Such a classiier is two-sided if the sequence of its output in addition converges to 0 on sets not belonging to the class. The present work obtains the below mentioned results for one-sided classes (...
متن کاملOne-sided Logic in Two-sided Markets
In this paper, I consider eight basic fallacies that can arise from using conventional wisdom from one-sided markets in two-sided market settings. These fallacies are illustrated using statements made in the context of regulatory investigations into credit card schemes in Australia and the United Kingdom. I discuss how these fallacies may be reconciled by proper use of a two-sided market analys...
متن کاملOne-sided epsilon-approximants
Given a finite point set P ⊂ R, we call a multiset A a one-sided weak ε-approximant for P (with respect to convex sets), if |P ∩ C|/|P | − |A ∩C|/|A| ≤ ε for every convex set C. We show that, in contrast with the usual (two-sided) weak ε-approximants, for every set P ⊂ R there exists a one-sided weak ε-approximant of size bounded by a function of ε and d.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Sciences
سال: 2023
ISSN: ['1072-3374', '1573-8795']
DOI: https://doi.org/10.1007/s10958-023-06541-8