Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 1980
Data sources: zbMATH Open
Mathematics of Operations Research
Article . 1980 . Peer-reviewed
Data sources: Crossref
DBLP
Article . 1980
Data sources: DBLP
versions View all 3 versions
addClaim

Invariant Half-Lines of Nonexpansive Piecewise-Linear Transformations

Invariant half-lines of nonexpansive piecewise-linear transformations
Authors: Elon Kohlberg;

Invariant Half-Lines of Nonexpansive Piecewise-Linear Transformations

Abstract

It is shown that if f is a nonexpansive piecewise-linear mapping of Rm into itself, there exists a unique half-line that f maps into itself and such that restriction of f thereto is a translation. One easy consequence of this result is that there exists a unique m-vector α such that for every m-vector x, the sequence fn(x) − nα remains bounded. In particular, fn(x)/n converges to the same limit α, for all x. Also, f has a fixed point if and only if α = 0. These results are applied to give alternative proofs of several known facts concerning the maximum expected n-period reward in a finite Markov decision process.

Related Organizations
Keywords

maximum expected n-period reward, finite Markov decision process, Markov and semi-Markov decision processes, fixed point, Fixed-point and coincidence theorems (topological aspects), invariant half-lines, Contraction-type mappings, nonexpansive mappings, \(A\)-proper mappings, etc., contraction mapping theorem, nonexpansive piecewise-linear mapping

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    34
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
34
Top 10%
Top 10%
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!