New Solution based on Hodge Decomposition for Abstract Games
This paper proposes Hodge Potential Choice (HPC), a new solution for abstract games with irreflexive dominance relations. This solution is formulated by involving geometric tools like differential forms and Hodge decomposition onto abstract games. We provide a workable algorithm for the proposed solution with a new data structure of abstract games. From the view of gaming, HPC overcomes several weaknesses of conventional solutions. HPC coincides with Copeland Choice in complete cases and can be extended to slove games with marginal strengths. It will be proven that the Hodge potential choice possesses three prevalent axiomatic properties: neutrality, strong monotonicity, dominance cycle s reversing independence, and sensitivity to mutual dominance. To compare the HPC with Copeland Choice in large samples of games, we design digital experiments with randomly generated abstract games with different sizes and completeness. The experimental results present the advantage of HPC in the statistical sense.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
On the Decomposition of Differential Game
To understand the complexity of the dynamic of learning in differential games, we decompose the game into components where the dynamic is well understood. One of the possible tools is Helmholtz's theorem, which can decom…
Topology-Preserving Neural Operator Learning via Hodge Decomposition
In this paper, we study solution operators of physical field equations on geometric meshes from a function-space perspective. We reveal that Hodge orthogonality fundamentally resolves spectral interference by isolating u…
Hodge-Decomposition of Brain Networks
We propose to analyze dynamically changing brain networks by decomposing them into three orthogonal components through the Hodge decomposition. We propose to quantify the magnitude and relative strength of each component…
A Unified Framework for Extensive-Form Game Abstraction with Bounds
Abstraction has long been a key component in the practical solving of large-scale extensive-form games. Despite this, abstraction remains poorly understood. There have been some recent theoretical results but they have b…
FormHodgelets: Localized Spectral Representations of Flows on Simplicial Complexes
We develop wavelet representations for edge-flows on simplicial complexes, using ideas rooted in combinatorial Hodge theory and spectral graph wavelets. We first show that the Hodge Laplacian can be used in lieu of the g…