Implementation with near complete information: The case of subgame perfection
T Kunimoto, O Tercieux - 2009 - ink.library.smu.edu.sg
While monotonicity is a necessary and almost sufficient condition for Nash
implementationand often a demanding one, almost any (non-monotonic, for instance) …
implementationand often a demanding one, almost any (non-monotonic, for instance) …
Subgame-perfect implementation under value perturbations and the hold-up problem
P Aghion, D Fudenberg, R Holden… - … paper, University of …, 2009 - academia.edu
We consider the robustness of extensive form mechanisms to common p&belief value
perturbations from common knowledge, which are situations where each player believes …
perturbations from common knowledge, which are situations where each player believes …
Model and method development for determining the completeness of information for remote detection of landmarks for autonomous mobile robots
O Poliarus, A Lebedynskyi, Y Chepusenko… - Technology audit and …, 2021 - papers.ssrn.com
The object of research is the completeness of information for making a navigation decision
by an autonomous mobile robot when it performs a task in an unfamiliar area without GPS. It …
by an autonomous mobile robot when it performs a task in an unfamiliar area without GPS. It …