Results 51 to 60 of about 11,066 (183)
Identification and estimation of continuous‐time dynamic discrete choice games
This paper considers the theoretical, computational, and econometric properties of continuous‐time dynamic discrete choice games with stochastically sequential moves, introduced by Arcidiacono, Bayer, Blevins, and Ellickson (2016). We consider identification of the rate of move arrivals, which was assumed to be known in previous work, as well as a ...
Jason R. Blevins
wiley +1 more source
Existence results for non-coercive problems
In this article, we investigate non-coercive variational equations under assumptions related to generalized monotonicity. We present some general abstract tools regarding the existence of bounded solutions and their multiplicity, which we then apply to ...
Diblík Josef +2 more
doaj +1 more source
A multiple integral finite volume method combined and Lagrange interpolation are applied in this paper to the Rosenau-RLW (RRLW) equation. We construct a two-level implicit fully discrete scheme for the RRLW equation.
Cui Guo +3 more
doaj +1 more source
Dolcher fixed point theorem and its connections with recent developments on compressive/expansive maps [PDF]
Elisa Sovrano and Fabio Zanolin, "Dolcher fixed point theorem and its connections with recent developments on compressive/expansive maps", in: Rendiconti dell’Istituto di Matematica dell’Università di Trieste. An International Journal of Mathematics, 46 (
Sovrano, Elisa, Zanolin, Fabio
core +1 more source
In the classical Bayesian persuasion model, an informed player and an uninformed one engage in a static interaction. This work extends this classical model to a dynamic setting where the state of nature evolves according to a Markovian law, allowing for a more realistic representation of real‐world situations where the state of nature evolves over time.
Ehud Lehrer, Dimitry Shaiderman
wiley +1 more source
From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory
In 1950, Nash proposed a natural equilibrium solution concept for games hence called Nash equilibrium, and proved that all finite games have at least one.
Christos Papadimitriou +1 more
doaj +1 more source
On the Computational Content of the Brouwer Fixed Point Theorem [PDF]
We study the computational content of the Brouwer Fixed Point Theorem in the Weihrauch lattice. One of our main results is that for any fixed dimension the Brouwer Fixed Point Theorem of that dimension is computably equivalent to connected choice of the Euclidean unit cube of the same dimension. Connected choice is the operation that finds a point in a
Vasco Brattka +2 more
openaire +1 more source
Coordination with sequential information acquisition
We investigate how differences in initial beliefs and sequential information choices affect the likelihood of coordination failure. To do so, we embed interim information acquisition (i.e., information acquisition after observing initial private information) into a standard global game mode with a normal information structure and improper prior.
Xiaoye Liao, Michal Szkup
wiley +1 more source
We consider discrete models of the form xn+1=xnf(xn−1)+hn, where hn is a nonnegative p-periodic sequence representing stocking in the population, and investigate their dynamics. Under certain conditions on the recruitment function f(x), we give a compact
Ziyad AlSharawi
doaj +1 more source

