Related papers: The Complexity of the Homotopy Method, Equilibrium…
We study the problem of finding optimal correlated equilibria of various sorts in extensive-form games: normal-form coarse correlated equilibrium (NFCCE), extensive-form coarse correlated equilibrium (EFCCE), and extensive-form correlated…
We describe, study, and experiment with an algorithm for finding all solutions of systems of polynomial equations using homotopy continuation and monodromy. This algorithm follows a framework developed in previous work and can operate in…
We study the problem of computing optimal correlated equilibria (CEs) in infinite-horizon multi-player stochastic games, where correlation signals are provided over time. In this setting, optimal CEs require history-dependent policies; this…
Similar to the role of Markov decision processes in reinforcement learning, Stochastic Games (SGs) lay the foundation for the study of multi-agent reinforcement learning (MARL) and sequential agent interactions. In this paper, we derive…
The explicit analytic solution of the Thomas Fermi equation thorough a new kind of analytic technique, namely the homotopy analysis method, was employed by Liao (Appl. Math. Comp. 144, (2003)). However, the base functions and the auxiliary…
We show that the two couple equations derived by approximate symmetry method and approximate homotopy symmetry method are connected by a transformation for the perturbed PDEs. Consequently, approximate homotopy series solutions can be…
We consider polynomial systems of Prony type, appearing in many areas of mathematics. Their robust numerical solution is considered to be difficult, especially in "near-colliding" situations. We consider a case when the structure of the…
Let $(X,\omega)$ be a compact K\"{a}hler manifold of dimension $n$, and fix $1\leq m\leq n.$ We prove that the complex Hessian equation $(\omega+dd^c\varphi)^m\wedge \omega^{n-m}=f\omega^n$, with $0<f\in \mathcal{C}^{\infty}(X)$ has a…
We consider finite-horizon and infinite-horizon versions of a dynamic game with $N$ selfish players who observe their types privately and take actions that are publicly observed. Players' types evolve as conditionally independent Markov…
For nonlinear equations, the homotopy methods (continuation methods) are popular in engineering fields since their convergence regions are large and they are quite reliable to find a solution. The disadvantage of the classical homotopy…
First order shape optimization methods, in general, require a large number of iterations until they reach a locally optimal design. While higher order methods can significantly reduce the number of iterations, they exhibit only local…
We study the problem of computing an Extensive-Form Perfect Equilibrium (EFPE) in 2-player games. This equilibrium concept refines the Nash equilibrium requiring resilience w.r.t. a specific vanishing perturbation (representing mistakes of…
We investigate the equilibrium stability and robustness in a class of moving target defense problems, in which players have both incomplete information and asymmetric cognition. We first establish a Bayesian Stackelberg game model for…
In this paper, we consider a class of infinitely degenerate partial differential systems to obtain the Nash equilibria in the mean field games. The degeneracy in the diffusion and the Hamiltonian may be different. This feature brings…
This paper introduces the concept of perfect monotone equilibrium in Bayesian games, which refines the standard monotone equilibrium by accounting for the possibility of unintended moves (trembling hand) and thereby enhancing robustness to…
Noncooperative game theory provides a normative framework for analyzing strategic interactions. However, for the toolbox to be operational, the solutions it defines will have to be computed. In this paper, we provide a single reduction that…
In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives. To this end, we introduce the notion of requirement, and the…
We consider the following problem for a fixed graph H: given a graph G and two H-colorings of G, i.e. homomorphisms from G to H, can one be transformed (reconfigured) into the other by changing one color at a time, maintaining an H-coloring…
This paper investigates the cost of solving systems of sparse polynomial equations by homotopy continuation. First, a space of systems of $n$-variate polynomial equations is specified through $n$ monomial bases. The natural locus for the…
We propose a general definition of perfect equilibrium which is applicable to a wide class of games. A key feature is the concept of completely mixed nets of strategies, based on a more detailed notion of carrier of a strategy. Under…