Related papers: Applying the Nash Bargaining Solution for a Reason…
In dynamic games with shared constraints, Generalized Nash Equilibria (GNE) are often computed using the normalized solution concept, which assumes identical Lagrange multipliers for shared constraints across all players. While widely used,…
We consider a gossip approach for finding a Nash equilibrium in a distributed multi-player network game. We extend previous results on Nash equilibrium seeking to the case when the players' cost functions may be affected by the actions of…
Understanding the uncertainty of a neural network's (NN) predictions is essential for many purposes. The Bayesian framework provides a principled approach to this, however applying it to NNs is challenging due to large numbers of parameters…
The optimization of power systems involves complex uncertainties, such as technological progress, political context, geopolitical constraints. Negotiations at COP21 are complicated by the huge number of scenarios that various people want to…
We propose the first loss function for approximate Nash equilibria of normal-form games that is amenable to unbiased Monte Carlo estimation. This construction allows us to deploy standard non-convex stochastic optimization techniques for…
Most familiar equilibrium concepts, such as Nash and correlated equilibrium, guarantee only that no single player can improve their utility by deviating unilaterally. They offer no guarantees against profitable coordinated deviations by…
Normalized ground state solutions (NGSS) of Schrodinger equations (SE) have attracted the attention of many research groups during the last decades. This is essentially due to their relevance in many fields in physics and engineering, where…
The paper studies the convergence, as $N$ tends to infinity, of a system of $N$ coupled Hamilton-Jacobi equations, the Nash system. This system arises in differential game theory. We describe the limit problem in terms of the so-called…
In the context of networking, research has focused on non-cooperative games, where the selfish agents cannot reach a binding agreement on the way they would share the infrastructure. Many approaches have been proposed for mitigating the…
The TRAP protocol solves rational agreement by combining accountable consensus with a one-shot BFTCR finalization phase. We present SNARE (Scalable Nash Agreement via Reward and Exclusion), the adaptation of TRAP to $n=5f{+}1$, and prove…
The recently defined class of integer programming games (IPG) models situations where multiple self-interested decision makers interact, with their strategy sets represented by a finite set of linear constraints together with integer…
We study partial information Nash equilibrium between a broker and an informed trader. In this setting, the informed trader, who possesses knowledge of a trading signal, trades multiple assets with the broker in a dealer market.…
We revisit the complexity of deciding, given a {\it bimatrix game,} whether it has a {\it Nash equilibrium} with certain natural properties; such decision problems were early known to be ${\mathcal{NP}}$-hard~\cite{GZ89}. We show that…
Normalizing constant (also called partition function, Bayesian evidence, or marginal likelihood) is one of the central goals of Bayesian inference, yet most of the existing methods are both expensive and inaccurate. Here we develop a new…
In this paper we present new proofs using real spectra of the finiteness theorem on Nash trivial simultaneous resolution and the finiteness theorem on Blow-Nash triviality for isolated real algebraic singularities. That is, we prove that a…
Regret in stochastic multi-armed bandits traditionally measures the difference between the highest reward and either the arithmetic mean of accumulated rewards or the final reward. These conventional metrics often fail to address fairness…
The uniqueness of the positive ground state solutions of fractional Shrodinger equations with a harmonic potential has not been covered by the breakthrough method developed in [1, 2]. It has remained an open question for years. [3] and [5]…
We design a distributed algorithm to seek generalized Nash equilibria of a robust game with uncertain coupled constraints. Due to the uncertainty of parameters in set constraints, we aim to find a generalized Nash equilibrium in the worst…
This paper explores the gain maximization problem of two nations engaging in non-cooperative bilateral trade. Probabilistic model of an exchange of commodities under different price systems is considered. Volume of commodities exchanged…
It is known that the generalized Nash equilibrium problem can be reformulated as a quasivariational inequality. Our aim in this work is to introduce a variational approach to study the existence of solutions for generalized ordinal Nash…