Related papers: Another Correction. Error estimates for Binomial a…
Comment on "Harold Jeffreys's Theory of Probability Revisited" [arXiv:0804.3173]
This manuscripts corrects some minor error in the paper, Mod. Phys. Lett. A 6 1893 (1991)
We close a gap appearing at the same time in the author's thesis "Iterated rings of bounded elements and generalizations of Schm\"udgen's theorem" [1] and in the author's article "Iterated rings of bounded elements and generalizations of…
We identify and correct an error in the paper "Excess Optimism: How Biased is the Apparent Error of an Estimator Tuned by SURE?" This correction allows new guarantees on the excess degrees of freedom--the bias in the error estimate of…
Error probabilities of random codes for memoryless channels are considered in this paper. In the area of communication systems, admissible error probability is very small and it is sometimes more important to discuss the relative gap…
Two sequential estimators are proposed for the odds p/(1-p) and log odds log(p/(1-p)) respectively, using independent Bernoulli random variables with parameter p as inputs. The estimators are unbiased, and guarantee that the variance of the…
In this paper we consider Dynkin's games with payoffs which are functions of an underlying process. Assuming extended weak convergence of underlying processes $\{S^{(n)}\}_{n=0}^{\infty}$ to a limit process $S$ we prove convergence Dynkin's…
Comment on ``Gibbs Sampling, Exponential Families and Orthogonal Polynomials'' [arXiv:0808.3852]
We consider potential games with mixed-integer variables, for which we propose two distributed, proximal-like equilibrium seeking algorithms. Specifically, we focus on two scenarios: i) the underlying game is generalized ordinal and the…
The original paper, as published in Nuclear Physics B in 1988, had a few factor-of-two errors. Some people got confused by those errors. The purpose of these errata is to make things clear. The revised version of the complete article is…
This paper corrects some mathematical errors in Holmstr\"om (1999) and clarifies the assumptions that are sufficient for the results of Holmstr\"om (1999). The results remain qualitatively the same.
In this paper, the author puts forward a variation of Feige's Hypothesis, which claims that it is hard on average refuting Unbalanced Max 3-XOR under biased assignments on a natural distribution. Under this hypothesis, the author…
After the social learning models were proposed, finding the solutions of the games becomes a well-defined mathematical question. However, almost all papers on the games and their applications are based on solutions built upon either an…
Estimation and inference in dynamic discrete choice models often relies on approximation to lower the computational burden of dynamic programming. Unfortunately, the use of approximation can impart substantial bias in estimation and results…
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 is a supplement to the article "Markov Chain Monte Carlo Based on Deterministic Transformations" available at http://arxiv.org/abs/1106.5850
Link prediction methods are frequently applied in recommender systems, e.g., to suggest citations for academic papers or friends in social networks. However, exposure bias can arise when users are systematically underexposed to certain…
The odds theorem and the corresponding solution algorithm (odds algorithm) are tools to solve a wide range of optimal stopping problems. Its generality and tractability have caught much attention. (Google for instance "Bruss odds" to obtain…
Some errors contained in the author's previous article "An example of Bautin-type bifurcation in a delay differential equation", JMAA, 329(2007), 777-789, are listed and corrected. Original abstract: In a previous paper we gave sufficient…
We provide an algorithm for computing the nucleolus for an instance of a weighted voting game in pseudo-polynomial time. This resolves an open question posed by Elkind. et.al. 2007.