English
Related papers

Related papers: Nash problem for a toric pair and the minimal log-…

200 papers

We prove that one can run the log minimal model program for log canonical $3$-fold pairs in characteristic $p>5$. In particular we prove the Cone Theorem, Contraction Theorem, the existence of flips and the existence of log minimal models…

Algebraic Geometry · Mathematics 2017-01-11 Joe Waldron

We prove that in a normal form n-player game with m actions for each player, there exists an approximate Nash equilibrium where each player randomizes uniformly among a set of O(log(m) + log(n)) pure strategies. This result induces an…

Computer Science and Game Theory · Computer Science 2013-07-19 Yakov Babichenko , Ron Peretz

We study the problem of computing an $\epsilon$-Nash equilibrium in repeated games. Earlier work by Borgs et al. [2010] suggests that this problem is intractable. We show that if we make a slight change to their model---modeling the players…

Computer Science and Game Theory · Computer Science 2015-03-24 Joseph Y. Halpern , Rafael Pass , Lior Seeman

A distance-based inconsistency indicator, defined by the third author for the consistency-driven pairwise comparisons method, is extended to the incomplete case. The corresponding optimization problem is transformed into an equivalent…

Other Computer Science · Computer Science 2015-05-11 S. Bozoki , J. Fulop , W. W. Koczkodaj

We introduce and study minimal (with respect to inclusion) solutions of systems of tropical linear differential equations. We describe the set of all minimal solutions for a single equation. It is shown that any tropical linear differential…

Algebraic Geometry · Mathematics 2025-04-01 Dima Grigoriev , Cristhian Garay López

We consider the inverse problem of determining the permeability from the pressure in a Darcy model of flow in a porous medium. Mathematically the problem is to find the diffusion coefficient for a linear uniformly elliptic partial…

Statistics Theory · Mathematics 2011-02-02 Masoumeh Dashti , Andrew M. Stuart

A fundamental shortcoming of the concept of Nash equilibrium is its computational intractability: approximating Nash equilibria in normal-form games is PPAD-hard. In this paper, inspired by the ideas of smoothed analysis, we introduce a…

Computer Science and Game Theory · Computer Science 2024-07-23 Constantinos Daskalakis , Noah Golowich , Nika Haghtalab , Abhishek Shetty

We study measure-theoretical aspects of torus piecewise isometries. Not much is known about this type of dynamical systems, except for the special case of one-dimensional interval exchange mappings. The last case is fundamentally different…

Dynamical Systems · Mathematics 2022-06-07 Michael Blank

An important result in discrepancy due to Banaszczyk states that for any set of $n$ vectors in $\mathbb{R}^m$ of $\ell_2$ norm at most $1$ and any convex body $K$ in $\mathbb{R}^m$ of Gaussian measure at least half, there exists a $\pm 1$…

Data Structures and Algorithms · Computer Science 2017-08-04 Nikhil Bansal , Daniel Dadush , Shashwat Garg , Shachar Lovett

The Navier-Stokes (NS) equations as a turbulence model have been widely applied in lots of fields. The NS equations contain such a fundamental assumption that all small physical/artificial disturbances could be neglected. Is this assumption…

Fluid Dynamics · Physics 2026-04-28 Shijie Qin , Kun Xu , Shijun Liao

We study an infinite-horizon discrete-time optimal stopping problem under non-exponential discounting. A new method, which we call the iterative approach, is developed to find subgame perfect Nash equilibria. When the discount function…

Optimization and Control · Mathematics 2021-07-15 Yu-Jui Huang , Zhou Zhou

We give a solution of the problem on trigonometric polynomials $f_n$ with the given leading harmonic $y\cos nt$ that deviate the least from zero in measure, more precisely, with respect to the functional $\mu(f_n)=mes\{t\in[0,2\pi]:…

Classical Analysis and ODEs · Mathematics 2009-12-21 Vitalii V. Arestov , Alexei S. Mendelev

In recent work of Hazan and Krauthgamer (SICOMP 2011), it was shown that finding an $\eps$-approximate Nash equilibrium with near-optimal value in a two-player game is as hard as finding a hidden clique of size $O(\log n)$ in the random…

Computational Complexity · Computer Science 2011-04-20 Per Austrin , Mark Braverman , Eden Chlamtac

We study loci of arcs on a smooth variety defined by order of contact with a fixed subscheme. Specifically, we establish a Nash-type correspondence showing that the irreducible components of these loci arise from (intersections of)…

Algebraic Geometry · Mathematics 2007-05-23 Lawrence Ein , Robert Lazarsfeld , Mircea Mustata

We continue our study of the relation between log minimal models and various types of Zariski decompositions. Let $(X,B)$ be a projective log canonical pair. We will show that $(X,B)$ has a log minimal model if either $K_X+B$ birationally…

Algebraic Geometry · Mathematics 2013-02-19 Caucher Birkar , Zhengyu Hu

In this paper, we propose an equilibrium-seeking algorithm for finding generalized Nash equilibria of non-cooperative monotone convex quadratic games. Specifically, we recast the Nash equilibrium-seeking problem as variational inequality…

Optimization and Control · Mathematics 2024-03-21 Bingqi Liu , Dominic Liao-McPherson

We consider $\epsilon$-equilibria notions for constant value of $\epsilon$ in $n$-player $m$-actions games where $m$ is a constant. We focus on the following question: What is the largest grid size over the mixed strategies such that…

Computer Science and Game Theory · Computer Science 2017-01-30 Itai Arieli , Yakov Babichenko

We prove convergence of a finite difference approximation of the compressible Navier--Stokes system towards the strong solution in $R^d,$ $d=2,3,$ for the adiabatic coefficient $\gamma>1$. Employing the relative energy functional, we find a…

Numerical Analysis · Mathematics 2020-02-19 Hana Mizerova , Bangwei She

This work belongs to the framework of inverse problems with linear model. The resolution of this type of problem consists in minimizing (possibly under constraints) a function of discrepancy between the measurements and a physical model of…

Information Theory · Computer Science 2021-09-28 Henri Lantéri

In this paper we present an averaging technique applicable to the design of zeroth-order Nash equilibrium seeking algorithms. First, we propose a multi-timescale discrete-time averaging theorem that requires only that the equilibrium is…

Optimization and Control · Mathematics 2023-02-10 Suad Krilašević , Sergio Grammatico