Metraipolis › archive › dc_154aaba2580e

What Variation Identifies Payoffs in a Dynamic Game? — arXiv:2609.14069

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.14069
License (as archived)
CC0-1.0
Archived
2026-10-16T02:55:25.840Z
SHA-256 of the archived text
a023a836373949401a639eee30920ad4ae6c3ae889edc589d0a8600d15b64fd3
Stable URL of this page
https://metraipolis.com/documento/dc_154aaba2580e

How to cite

What Variation Identifies Payoffs in a Dynamic Game? — arXiv:2609.14069 — arXiv (en), https://arxiv.org/abs/2609.14069 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_154aaba2580e (Metraipolis archive dc_154aaba2580e, sha256 a023a836373949401a639eee30920ad4ae6c3ae889edc589d0a8600d15b64fd3)
BibTeX
@misc{dc154aaba2580e,
  title = {What Variation Identifies Payoffs in a Dynamic Game? — arXiv:2609.14069},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.14069},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_154aaba2580e; sha256 a023a836373949401a639eee30920ad4ae6c3ae889edc589d0a8600d15b64fd3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14069. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Observed choice in a dynamic game mixes current profit with continuation value. A rival adds a second problem: the same comparison averages over the rival's equilibrium policy. Changing the primitive transition rewrites continuation technology; changing the rival's Markov policy, holding that law fixed, rewrites the mixture over rival-contingent payoffs. The two are not substitutes. For a rival-feature payoff of rank $K$, rank identification up to location requires $\Ephi=\lceil(MK-1)/(M-1)\rceil$ policy environments, and a second kernel when payoffs are saturated. Rank can still be restored by arbitrarily small policy differences. Independent private shocks force mixed rival actions to factor, so a payoff that depends jointly on $d$ rivals is visible only at order $\eta^{d}$ near a common interior baseline. Either rank fails or the smallest identified singular value is at most $\kappa\eta^{\dPhi}$, independently of how many kernels are stacked. Oracle-GLS variance in that direction vanishes only if $n\eta^{2\dPhi}$ diverges. An Anderson--Rubin set that carries first-stage error in the design matrix covers without a vanishing-risk condition. On U.S.\ airline entry, even among rank-identified directions, the most favorable rival-dependent contrast is several times wider than observed behavior.

Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-09-15 in econ.EM).
Categorie arXiv: Econometrics (econ.EM) ; Theoretical Economics (econ.TH).
Pagina del lavoro: https://arxiv.org/abs/2609.14069 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T02:42:47.193Z dalla pagina https://arxiv.org/catchup/econ.EM/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).