Related papers: Another Correction. Error estimates for Binomial a…
This is an erratum to our paper.
Convergence of the policy iteration method for discrete and continuous optimal control problems holds under general assumptions. Moreover, in some circumstances, it is also possible to show a quadratic rate of convergence for the algorithm.…
This paper gives game-theoretic versions of several results on "merging of opinions" obtained in measure-theoretic probability and algorithmic randomness theory. An advantage of the game-theoretic versions over the measure-theoretic results…
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…
This paper deals with the application of Approximation Theory type techniques to study a classical problem in Probability: estimating the parameter of a biased coin. For this purpose, a Minimax Estimation problem is considered and the…
This note replies Dr. Jensen (2010) comments on Problem 2.3, which was left in Fuh (2010). In the following, we use the same notations and definitions in Fuh (2006) unless specified.
Unfortunately, the article "A Comparative Study to Benchmark Cross-project Defect Prediction Approaches" has a problem in the statistical analysis which was pointed out almost immediately after the pre-print of the article appeared online.…
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,…
We correct some errors in the two papers published with the above title in Class. Quant. Grav. 19 (2002). In particular, the correct prescription for computing the probabilities is given, in that appropriate normalization factors are…
Discussion of ``One-step sparse estimates in nonconcave penalized likelihood models'' [arXiv:0808.1012]
Discussion of ``One-step sparse estimates in nonconcave penalized likelihood models'' [arXiv:0808.1012]
We establish the first hardness results for the problem of computing the value of one-round games played by a verifier and a team of provers who can share quantum entanglement. In particular, we show that it is NP-hard to approximate within…
We give a new and short proof of a theorem on k-hypertournament losing scores due to Zhou et al. [G. Zhou, T. Yao, K. Zhang, On score sequences of k-tournaments, European J. Comb., 21, 8 (2000) 993-1000.]
This purpose of this letter is to handle a gap that was found in the proof of Theorem 2 in the paper "The generalized stochastic likelihood decoder: random coding and expurgated bounds."
There are many papers written on the Two Envelopes Problem that usually study some of its variations. In this paper we will study and compare the most significant variations of the problem. We will see the correct decisions for each player…
The note presents a modified proof of a loss bound for the exponentially weighted average forecaster with time-varying potential. The regret term of the algorithm is upper-bounded by sqrt{n ln(N)} (uniformly in n), where N is the number of…
In classical game theory, optimal strategies are determined for games with complete information; this requires knowledge of the opponent's goals. We analyze games when a player is mistaken about their opponents goals. For definitiveness, we…
Comment on "Harold Jeffreys's Theory of Probability Revisited" [arXiv:0804.3173]
Comment on "Harold Jeffreys's Theory of Probability Revisited" [arXiv:0804.3173]
Comment on "Harold Jeffreys's Theory of Probability Revisited" [arXiv:0804.3173]