Related papers: Artin approximation compatible with a change of va…
Artin approximation and other related approximation results are used in various areas. The traditional formulation of such results is restricted to filtrations by powers of ideals, $\{I^j\}$, and to Noetherian rings. In this paper we extend…
The use of adaptive mesh refinement (AMR) techniques is crucial for accurate and efficient simulation of higher dimensional spacetimes. In this work we develop an adaptive algorithm tailored to the integration of finite difference…
While there have been a number of studies about the efficacy of methods to find exact Nash equilibria in bimatrix games, there has been little empirical work on finding approximate Nash equilibria. Here we provide such a study that compares…
Computing a Nash equilibrium (NE) is a central task in computer science. An NE is a particularly appropriate solution concept for two-agent settings because coalitional deviations are not an issue. However, even in this case, finding an NE…
A method is suggested for treating the well-known deficiency in the use of Pade approximants that are well suited for approximating rational functions, but confront problems in approximating irrational functions. We develop the approach of…
We study techniques to incentivize self-interested agents to form socially desirable solutions in scenarios where they benefit from mutual coordination. Towards this end, we consider coordination games where agents have different intrinsic…
Approximation of real analytic functions by Nash functions is a classical topic in real geometry. In this paper, we focus on the Nash approximation of an analytic desingularization of a Nash function germ obtained by a sequence of…
We address Nash equilibrium problems in a partial-decision information scenario, where each agent can only exchange information with some neighbors, while its cost function possibly depends on the strategies of all agents. We characterize…
We introduce a discontinuous Galerkin method for the mixed formulation of the elasticity eigenproblem with reduced symmetry. The analysis of the resulting discrete eigenproblem does not fit in the standard spectral approximation framework…
In this paper, we demonstrate that in many NP-complete variants of the stable matching problem, such as the Stable Hypergraph Matching problem, the Stable Multicommodity Flow problem, and the College Admission problem with common quotas, a…
A Nitche's method is presented to couple different mechanical models. They include coupling of a solid and a beam and of a solid and a plate. Both conforming and non-conforming formulations are presented. In a non-conforming for- mulation,…
We provide a numerically robust and fast method capable of exploiting the local geometry when solving large-scale stochastic optimisation problems. Our key innovation is an auxiliary variable construction coupled with an inverse Hessian…
In scientific computing, the acceleration of atomistic computer simulations by means of custom hardware is finding ever growing application. A major limitation, however, is that the high efficiency in terms of performance and low power…
A system of singularly perturbed ordinary differential equations of first order with given initial conditions is considered. The leading term of each equation is multiplied by a small positive parameter. These parameters are assumed to be…
We reformulate the Cavity Approximation (CA), a class of algorithms recently introduced for improving the Bethe approximation estimates of marginals in graphical models. In our new formulation, which allows for the treatment of multivalued…
Nash equilibrium} (NE) can be stated as a formal theorem on a multilinear form, free of game theory terminology. On the other hand, inspired by this formalism, we state and prove a {\it multilinear minimax theorem}, a generalization of von…
We present guidelines for deriving new Nitsche Finite Element Methods to enforce equality and inequality constraints that act on the value of the unknown mechanical quantity. We first formulate the problem as a stabilized finite element…
This paper aims to compare and evaluate various obstacle approximation techniques employed in the context of the steady incompressible Navier-Stokes equations. Specifically, we investigate the effectiveness of a standard volume penalization…
We study the problem of approximate near neighbor (ANN) search and show the following results: - An improved framework for solving the ANN problem using locality-sensitive hashing, reducing the number of evaluations of locality-sensitive…
Numerical approximate computation can solve large and complex problems fast. It has the advantage of high efficiency. However it only gives approximate results, whereas we need exact results in many fields. There is a gap between…