Polynomial Graphs With Applications To Graphical Games, Extensive-Form Games, and Games With Emergent Node Tree Structures

Simple item page
dc.creatorDatta, Ruchira S.
dc.date2006-12-16
dc.date.accessioned2026-07-07T07:35:28Z
dc.date.available2026-07-07T07:35:28Z
dc.descriptionWe prove a theorem computing the number of solutions to a system of equations which is generic subject to the sparsity conditions embodied in a graph. We apply this theorem to games obeying graphical models and to extensive-form games. We define emergent-node tree structures as additional structures which normal form games may have. We apply our theorem to games having such structures. We briefly discuss how emergent node tree structures relate to cooperative games.
dc.identifierhttps://arxiv.org/abs/math/0612463
dc.identifierhttp://arxiv.org/abs/math/0612463
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/120103
dc.subjectCommutative Algebra
dc.subjectCombinatorics
dc.subject13P99, 91A10
dc.titlePolynomial Graphs With Applications To Graphical Games, Extensive-Form Games, and Games With Emergent Node Tree Structures
dc.typetext

Files

Collections

arXiv