[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
Volume 45, Issue 1-2Mar 2016
Reflects downloads up to 09 Jan 2025Bibliometrics
Skip Table Of Content Section
research-article
Feasibility and individual rationality in two-person Bayesian games
Abstract

We define feasible, posterior individually rational solutions for two-person Bayesian games with a single informed player. Such a solution can be achieved by direct signalling from the informed player and requires approval of both players after ...

research-article
Allocation games with caps: from Captain Lotto to all-pay auctions
Abstract

A Lotto game is a two-person zero-sum game where each player chooses a distribution on nonnegative real numbers with given expectation, so as to maximize the probability that his realized choice is higher than his opponent’s. These games arise in ...

research-article
Common-value all-pay auctions with asymmetric information and bid caps
Abstract

We study a class of two-player common-value all-pay auctions (contests) with asymmetric information under the assumption that one of the players has an information advantage over his opponent and both players are budget-constrained. We extend the ...

research-article
Dynamic moral hazard without commitment
Abstract

We study a discrete-time model of repeated moral hazard without commitment. In every period, a principal finances a project, choosing the scale of the project and a contingent payment plan for an agent, who has the opportunity to appropriate the ...

research-article
Correlated equilibria of two person repeated games with random signals
Abstract

In this work we extend a result of Lehrer (Math Oper Res 17(1):175–199, 1992a) characterising the correlated equilibrium payoffs in undiscounted two player repeated games with partial monitoring to the case in which the signals are permitted to be ...

research-article
Recursive games: uniform value, Tauberian theorem and the Mertens conjecture “$$Maxmin=\lim v_n=\lim v_{\uplambda }$$”
Abstract

We study two-player zero-sum recursive games with a countable state space and finite action spaces at each state. When the family of n-stage values $$\{v_n,n\ge 1\}$$ is totally bounded for the uniform norm, we prove the existence of the uniform ...

research-article
The challenge of non-zero-sum stochastic games
Abstract

For a broad definition of time-discrete stochastic games, their zero-sum varieties have values. But the existence of $$\epsilon $$-equilibrium for the corresponding non-zero-sum games has proven elusive. We present the problems associated with $$\...

research-article
Subgame-perfection in recursive perfect information games, where each player controls one state
Abstract

We consider a class of multi-player games with perfect information and deterministic transitions, where each player controls exactly one non-absorbing state, and where rewards are zero for the non-absorbing states. With respect to the average ...

research-article
Eliciting performance: deterministic versus proportional prizes
Abstract

Two standard schemes for awarding a prize have been examined in the literature. The prize is awarded $$(\pi _{D})$$ deterministically: to the contestant with the highest output; $$(\pi _{P})$$ probabilistically: to all contestants, with ...

research-article
Characterizations of solutions for games with precedence constraints
Abstract

We generalize the characterizations of the positive core and the positive prekernel to TU games with precedence constraints and show that the positive core is characterized by non-emptiness (NE), boundedness (BOUND), covariance under strategic ...

research-article
Imitation dynamics with payoff shocks
Abstract

We investigate the impact of payoff shocks on the evolution of large populations of myopic players that employ simple strategy revision protocols such as the “imitation of success”. In the noiseless case, this process is governed by the standard (...

research-article
Continuous-time limit of dynamic games with incomplete information and a more informed player
Abstract

We study a two-player, zero-sum, dynamic game with incomplete information where one of the players is more informed than his opponent. We analyze the limit value as the players play more and more frequently. The more informed player observes the ...

research-article
General limit value in zero-sum stochastic games
Abstract

Bewley and Kohlberg (Math Oper Res 1(3):197–208, 1976) and Mertens and Neyman (Int J Game Theory 10(2):53–66, 1981) have respectively proved the existence of the asymptotic value and the uniform value in zero-sum stochastic games with finite state ...

research-article
On the dispensable role of time in games of perfect information
Abstract

In Aumann (Games Econ Behav 8(1):6–19, 1995, Games Econ Behav 23(1):97–105, 1998), time is assumed implicitly in the description of games of perfect information, and it is part of the epistemic distinction between ex-ante and ex-post knowledge. We ...

research-article
Operator approach to values of stochastic games with varying stage duration
Abstract

We study the links between the values of stochastic games with varying stage duration h, the corresponding Shapley operators $$\mathbf{T}$$ and $$\mathbf{T}_h= h\mathbf{T}+ (1-h ) Id$$ and the solution of the evolution equation $$\dot{f}_t = (\...

research-article
Values of vector measure market games and their representations
Abstract

We offer a representation result for values of vector measure market games, proving that the value of a game is an “average of marginals”. As a direct result we obtain that the Mertens value is the unique continuous value on the space of vector ...

research-article
Projections and functions of Nash equilibria
Abstract

We show that any non-empty compact semi-algebraic subset of mixed action profiles on a fixed player set can be represented as the projection of the set of equilibria of a game in which additional binary players have been added. Even stronger, we ...

research-article
The complexity of interacting automata
Abstract

This paper studies the interaction of automata of size m. We characterise statistical properties satisfied by random plays generated by a correlated pair of automata with m states each. We show that in some respect the pair of automata can be ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.