Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0812.3651

Time management in a Poisson fishing model

Anna Karpowicz·Krzysztof Szajowski
View original source ↗Read source document ↗Export metadata ↓

Abstract

The aim of the paper is to extend the model of "fishing problem". The simple formulation is following. The angler goes to fishing. He buys fishing ticket for a fixed time. There are two places for fishing at the lake. The fishes are caught according to renewal processes which are different at both places. The fishes' weights and the inter-arrival times are given by the sequences of i.i.d. random variables with known distribution functions. These distributions are different for the first and second fishing place. The angler's satisfaction measure is given by difference between the utility function dependent on size of the caught fishes and the cost function connected with time. On each place the angler has another utility functions and another cost functions. In this way, the angler's relative opinion about these two places is modeled. For example, on the one place better sort of fish can be caught with bigger probability or one of the places is more comfortable. Obviously our angler wants to have as much satisfaction as possible and additionally he have to leave the lake before the fixed moment. Therefore his goal is to find two optimal stopping times in order to maximize his satisfaction. The first time corresponds to the moment, when he eventually should change the place and the second time, when he should stop fishing. These stopping times have to be less than the fixed time of fishing. The value of the problem and the optimal stopping times are derived.

Explore related subjects

math.PRmath.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anna Karpowicz, Krzysztof Szajowski. 2008-12-18. Time management in a Poisson fishing model. https://arxiv.org/abs/0812.3651

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR↗
arXiv2026

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR↗
arXiv2026

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR↗