相关论文: Correction. Error estimates for binomial approxima…
This short note is devoted to the unraveling of the hidden interactivity of ordinary games which is an artefact of predictions of the behaviour of other players by the fixed player and describes deviations of their real behaviour from such…
We survey results on the hardness of approximating combinatorial optimization problems.
We study a multi-agent decision problem in population games, where agents select from multiple available strategies and continually revise their selections based on the payoffs associated with these strategies. Unlike conventional…
Comment on ``Boosting Algorithms: Regularization, Prediction and Model Fitting'' [arXiv:0804.2752]
This paper is a corrigendum to the article 'On the ideal theorem for number fields`. The main result of this paper proves to be untrue and is replaced by an estimate of a weighted sum with an improved error term.
We present a method for randomizing formulas for bilinear computation of matrix products. We consider the implications of such randomization when there are two sources of error: One due to the formula itself only being approximately…
Comment: Monitoring Networked Applications With Incremental Quantile Estimation [arXiv:0708.0302]
Comment: Monitoring Networked Applications With Incremental Quantile Estimation [arXiv:0708.0302]
Lower bounds for some explicit decision problems over the complex numbers are given.
The projection games (aka Label-Cover) problem is of great importance to the field of approximation algorithms, since most of the NP-hardness of approximation results we know today are reductions from Label-Cover. In this paper we design…
This thesis presents some geometric insights into three different types of two player prediction games -- namely general learning task, prediction with expert advice, and online convex optimization. These games differ in the nature of the…
Motivated by problems in contact mechanics, we propose a duality approach for computing approximations and associated a posteriori error bounds to solutions of variational inequalities of the first kind. The proposed approach improves upon…
We propose a novel online learning method for minimizing regret in large extensive-form games. The approach learns a function approximator online to estimate the regret for choosing a particular action. A no-regret algorithm uses these…
We correct here two errors in our earlier paper "An algebraic model for finite loop spaces" [arXiv:1212.2033]
This article corrects two mistakes in the article "Coarse homology theories" [math.AT/0106183].
Notes on the Spinpossible puzzle game. We give a mathematical description of the game, prove some elementary bounds on the length of optimal solutions, and consider variations of the game which place restrictions on the set of permitted…
In this paper, we study a game with positive or plus infinite expectation and determine the optimal proportion of investment for maximizing the limit expectation of growth rate per attempt. With this objective, we introduce a new pricing…
Approachability has become a standard tool in analyzing earning algorithms in the adversarial online learning setup. We develop a variant of approachability for games where there is ambiguity in the obtained reward that belongs to a set,…
In this paper, we obtain error bound for binomial and negative binomial approximations to weighted sums of locally dependent random variables, using Stein's method. We also discuss approximation results for weighted sums of independent…
This note covers two parts. The first one provides an errata to the paper "Numerical and analytical modeling of busbar systems". We mainly give the correction for three equations affected by a typographical mistake. Despite the corrections…