Excludability and Bounded Computational Capacity Strategies
نویسندگان
چکیده
We study the notion of excludability in repeated games with vector payoffs, when one of the players is restricted to strategies with bounded computational capacity. We show that a closed set that does not contain a convex approachable set is excludable by player 2 when player 1 is restricted to use only boundedrecall strategies. We also show that when player 1 is restricted to use strategies that can be implemented by finite automata, player 2 can exclude him from any closed, non-convex set whose convex hull is minimal convex approachable. ∗School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel; e-mail: [email protected] †School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel, and Kellogg School of Management, Northwestern University, 2001 Sheridan Road, Evanston, IL 60208-2001. e-mail: [email protected], [email protected]
منابع مشابه
Excludability and Bounded Computational Capacity
We study the notion of excludability in repeated games with vector payoffs, when one of the players is restricted to strategies with bounded computational capacity. We show that a closed set is excludable by Player 2 when Player 1 is restricted to using only bounded-recall strategies if and only if it does not contain a convex approachable set. We provide partial results when Player 1 is restri...
متن کاملNo-Regret with Bounded Computational Capacity
We deal with no regret and related aspects of vector-payoff games when one of the players is limited in computational capacity. We show that player 1 can almost approach with bounded-recall strategies, or with finite automata, any convex set which is approachable when no capacity bound is present. In particular we deduce that with bounded computational capacity player 1 can ensure having almost...
متن کاملA companion of Ostrowski's inequality for functions of bounded variation and applications
A companion of Ostrowski's inequality for functions of bounded variation and applications are given.
متن کاملBounded computational capacity equilibrium
A celebrated result of Abreu and Rubinstein (1988) states that in repeated games, when the players are restricted to playing strategies that can be implemented by finite automata and they have lexicographic preferences, the set of equilibrium payoffs is a strict subset of the set of feasible and individually rational payoffs. In this paper we explore the limitations of this result. We prove tha...
متن کاملNotes on Computational Uncertainties in Probabilistic Risk/Safety Assessment
In this article, we study computational uncertainties in probabilistic risk/safety assessment resulting from the computational complexity of calculations of risk indicators. We argue that the risk analyst faces the fundamental epistemic and aleatory uncertainties of risk assessment with a bounded calculation capacity, and that this bounded capacity over-determines both the design of models and ...
متن کامل