This paper characterizes those preferences over bounded infinite utility streams that satisfy the time value of money principle and an additivity property, and the subset of these preferences that, in addition, are either impatient or patient. Based on this characterization, the paper introduces...

This paper characterizes those preferences over bounded infinite utility streams that satisfy the time value of money principle and an additivity property, and the subset of these preferences that in addition are either impatient or patient. Based on this characterization, the paper introduces a...

This paper initiates the study of long term interactions where players' bounded rationality varies over time. Time dependent bounded rationality is reflected in part in the number $\psi(t)$ of distinct strategies in the first $t$-stages. We examine how the growth rate of $\psi_i(t)$ affects...

The value is a solution concept for n-person strategic games, developed by Nash, Shapley, and Harsanyi. The value of a game is an a priori evaluation of the economic worth of the position of each player, reflecting the players' strategic possibilities, including their ability to make threats...

In this paper we offer a new approach to modeling strategies of bounded complexity, the so-called factor-based strategies. In our model, the strategy of a player in the multi-stage game does not directly map the set of histories H to the set of her actions. Instead, the player's perception of H...

We examine incentive-compatible mechanisms for fair financing and efficient selection of a public budget (or public good). A mechanism selects the level of the public budget and imposes taxes on individuals. Individuals’ preferences are quasilinear. Fairness is expressed as weak monotonicity...

One way to express bounded rationality of a player in a game theoretic models is by specifying a set of feasible strategies for that player. In dynamic game models with finite automata and bounded recall strategies, for example, feasibility of strategies is determined via certain complexity...

Every continuous-time stochastic game with finitely many states and actions has a uniform and limiting-average equilibrium payoff.

We introduce asymptotic analysis of stochastic games with short-stage duration. The play of stage $k$, $k\geq 0$, of a stochastic game $\Gamma_\delta$ with stage duration $\delta$ is interpreted as the play in time $k\delta\leq t<(k+1)\delta$, and therefore the average payoff of the $n$-stage play per unit of time is the sum of the payoffs in the first $n$ stages divided by $n\delta$, and the $\lambda$-discounted present value of a payoff $g$ in stage $k$ is $\lambda^{k\delta} g$. We define convergence, strong convergence, and exact convergence of the data of a family $(\Gamma_\delta)_{\delta>0}$ as the stage duration $\delta$ goes to $0$, and study the...</(k+1)\delta$,>

The variation of a martingale m[k] of k+1 probability measures p(0),...,p(k) on a finite (or countable) set X is the expectation of the sum of ||p(t)-p(t-1)|| (the L one norm of the martingale differences p(t)-p(t-1)), and is denoted V(m[k]). It is shown that V(m[k]) is less than or equal to the...