A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Distributed strategic learning has been getting attention in recent years. As systems become distributed finding Nash equilibria in a distributed fashion is becoming more important for various applications. In this paper, we develop a distributed strategic learning framework for seeking Nash equilibria under stochastic…
Given a multifunction from X to the k−fold symmetric product Symk(X), we use the Dold-Thom Theorem to establish a homological selection Theorem. This is used to establish existence of Nash equilibria. Cost functions in problems concerning the existence of Nash Equilibria are traditionally multilinear in the mixe…
In this note, we present an existence result of a Nash equilibrium between electricity producers selling their production on an electricity market and buying CO2 emission allowances on an auction carbon market. The producers' strategies integrate the coupling of the two markets via the cost functions of the electricity…
We consider a market impact game for n risk-averse agents that are competing in a market model with linear transient price impact and additional transaction costs. For both finite and infinite time horizons, the agents aim to minimize a mean-variance functional of their costs or to maximize the expected exponential u…
Let M and N be Nash manifolds, and f and g Nash maps from M to N. If M and N are compact and if f and g are analytically R-L equivalent, then they are Nash R-L equivalent. In the local case, Cinfty R-L equivalence of two Nash map germs implies Nash R-L equivalence. This shows a difference of Nash…
This paper considers the problem of inverse reinforcement learning in zero-sum stochastic games when expert demonstrations are known to be not optimal. Compared to previous works that decouple agents in the game by assuming optimality in expert strategies, we introduce a new objective function that directly pits expert…
In this paper, we prove the equivalent of ultracontractive bound of heat semigroup or the uniform upper bound of the heat kernel with the Nash inequality, Log-Sobolev inequalities on graphs. We also show that under the assumption of volume growth and nonnegative curvature CDE′(n,0) the Sobolev inequality, Nash inequa…
The h-cobordism theorem is a noted theorem in differential and PL topology. A generalization of the h-cobordism theorem for possibly non simply connected manifolds is the so called s-cobordism theorem. In this paper, we prove semialgebraic and Nash versions of these theorems. That is, starting with semialgebraic or Nas…
In this paper both we establish the best constants for the Nash inequalities on the standard unit sphere Sn of Rn+1 and we give answers on the existence of extremal functions on the corresponding problems. Also we study the problem of the best constants in the case, where the data are invarian…
In this paper, we analyze Nash equilibria between electricity producers selling their production on an electricity market and buying CO2 emission allowances on an auction carbon market. The producers' strategies integrate the coupling of the two markets via the cost functions of the electricity production. We set out a…
We present the quantum model of Bertrand duopoly and study the entanglement behavior on the profit functions of the firms. Using the concept of optimal response of each firm to the price of the opponent, we found only one Nash equilibirum point for maximally entangled initial state. The very presence of quantum entangl…
This article presents a proof of the existence of Bertrand-Nash equilibrium prices with multi-product firms and under the Logit model of demand that does not rely on restrictive assumptions on product characteristics, firm homogeneity or symmetry, product costs, or linearity of the utility function. The proof is based …
Community detection in graphs has been the subject of many algorithms. Recent methods want to optimize a modularity function which shows a maximum of relationships within communities and found a minimum of inter-community relations. these algorithms are applied to unipartite, multipartite and directed graphs. However, …