Unlocking of predicate: application to constructing a non-anticipating selection

DOI10.20537/VM170211MaRDI QIDQ4639860zbMATH OpenOpenAlexFDO

Authors Dmitriĭ A. Serkov

Publication date 11 May 2018

Published in Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1703.10918

zbMATH Keywords

fixed pointsnonanticipating mappingspredicate unlocking

Mathematics Subject Classification ID

Applications of set theory (03E75) Set-valued maps in general topology (54C60) Control/observation systems with incomplete information (93C41)

Abstract: We consider an approach to constructing a non-anticipating selection of a multivalued mapping; such a problem arises in control theory under conditions of uncertainty. The approach is called "unlocking of predicate" and consists in the reduction of finding the truth set of a predicate to searching fixed points of some mappings. Unlocking of predicate gives an extra opportunity to analyze the truth set and to build its elements with desired properties. In this article, we outline how to build "unlocking mappings" for some general types of predicates: we give a formal definition of the predicate unlocking operation, the rules for the construction and calculation of "unlocking mappings" and their basic properties. As an illustration, we routinely construct two unlocking mappings for the predicate "be non-anticipating mapping" and then on this base we provide the expression for the greatest non-anticipating selection of a given multifunction.

Recommendations

• An approach to analysis of the set of truth: unlocking of predicate
• scientific article; zbMATH DE number 2003630
• The iterative realization of nonanticipating multivalued mappings
• Nonanticipating multimappings and their construction by the method of program iterations. II
• Nonanticipating multimappings and their construction by the method of program iterations. I

Cites work

• A generalization of Brouwer's fixed point theorem
• A lattice-theoretical fixpoint theorem and its applications
• An approach to analysis of the set of truth: unlocking of predicate
• Chain-complete posets and directed sets with applications
• Constructive versions of Tarski's fixed point theorems
• scientific article; zbMATH DE number 3547097 (Why is no real title available?)
• scientific article; zbMATH DE number 3614551 (Why is no real title available?)
• scientific article; zbMATH DE number 3264065 (Why is no real title available?)
• Minimax Theorems
• Non-anticipating selectors for set-valued mappings
• Non-cooperative games
• On fixed point theory and its applications to equilibrium models
• On von Neumann's minimax theorem

Cited in

(3)

• On the construction of a predicate truth set
• An approach to analysis of the set of truth: unlocking of predicate
• On the construction of partially non-anticipative multiselector and its application to dynamic optimization problems

This page was built for publication: Unlocking of predicate: application to constructing a non-anticipating selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639860)