Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCercetare AI

analiza aiqbench

This paper establishes a rigorous theoretical foundation for information representation in games with incomplete information, proving the existence and uniqueness of a minimal Strategic Type Space (STS). The research demonstrates that this optimal structure possesses a recursive nature that can be efficiently captured by a finite automaton, offering a compact framework for modeling complex belief hierarchies. While the work is deeply theoretical, it provides a significant structural insight for advancing computational game theory and algorithmic mechanism design.
Surse care acoperăarXiv, AWS, InfoQ, Latent Space

Strategic Type Spaces

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2606.08297v1 Announce Type: cross Abstract: We provide a strategic foundation for information: in any given game with incomplete information we define strategic quotients as information representations that are sufficient for players to compute best-responses to other players. We prove 1/ existence and essential uniqueness of a minimal strategic quotient called the Strategic Type Space (STS) in which a type is given by an interim correlated rationalizability hierarchy and represents a set of beliefs over other players' types and nature that rationalize this hierarchy and 2/ that the minimal STS has a recursive structure that is captured by a finite automaton.

Abstract:We provide a strategic foundation for information: in any given game with incomplete information we define strategic quotients as information representations that are sufficient for players to compute best-responses to other players. We prove 1/ existence and essential uniqueness of a minimal strategic quotient called the Strategic Type Space (STS) in which a type is given by an interim correlated rationalizability hierarchy and represents a set of beliefs over other players' types and nature that rationalize this hierarchy and 2/ that the minimal STS has a recursive structure that is captured by a finite automaton.

Theoretical Economics (econ.TH); Computation and Language (cs.CL)

arXiv:2606.08297 [econ.TH]

(or arXiv:2606.08297v1 [econ.TH] for this version)

https://doi.org/10.48550/arXiv.2606.08297 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 193 cuvinte

Subiecte conexe