All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 9 of 9

Showing per page

Bayesian Nash equilibrium seeking for multi-agent incomplete-information aggregative games

Hanzheng Zhang, Huashu Qin, Guanpu Chen (2023)

Kybernetika

In this paper, we consider a distributed Bayesian Nash equilibrium (BNE) seeking problem in incomplete-information aggregative games, which is a generalization of either Bayesian games or deterministic aggregative games. We handle the aggregation function to adapt to incomplete-information situations. Since the feasible strategies are infinite-dimensional functions and lie in a non-compact set, the continuity of types brings barriers to seeking equilibria. To this end, we discretize the continuous...

Bias-variance decomposition in Genetic Programming

Taras Kowaliw, René Doursat (2016)

Open Mathematics

We study properties of Linear Genetic Programming (LGP) through several regression and classification benchmarks. In each problem, we decompose the results into bias and variance components, and explore the effect of varying certain key parameters on the overall error and its decomposed contributions. These parameters are the maximum program size, the initial population, and the function set used. We confirm and quantify several insights into the practical usage of GP, most notably that (a) the...

Binomial residues

Eduardo Cattani, Alicia Dickenstein, Bernd Sturmfels (2002)

Annales de l’institut Fourier

A binomial residue is a rational function defined by a hypergeometric integral whose kernel is singular along binomial divisors. Binomial residues provide an integral representation for rational solutions of A -hypergeometric systems of Lawrence type. The space of binomial residues of a given degree, modulo those which are polynomial in some variable, has dimension equal to the Euler characteristic of the matroid associated with A .

Border bases and kernels of homomorphisms and of derivations

Janusz Zieliński (2010)

Open Mathematics

Border bases are an alternative to Gröbner bases. The former have several more desirable properties. In this paper some constructions and operations on border bases are presented. Namely; the case of a restriction of an ideal to a polynomial ring (in a smaller number of variables), the case of the intersection of two ideals, and the case of the kernel of a homomorphism of polynomial rings. These constructions are applied to the ideal of relations and to factorizable derivations.

Branching random walks on binary search trees: convergence of the occupation measure

Eric Fekete (2010)

ESAIM: Probability and Statistics

We consider branching random walks with binary search trees as underlying trees. We show that the occupation measure of the branching random walk, up to some scaling factors, converges weakly to a deterministic measure. The limit depends on the stable law whose domain of attraction contains the law of the increments. The existence of such stable law is our fundamental hypothesis. As a consequence, using a one-to-one correspondence between binary trees and plane trees, we give a description of the...

Currently displaying 1 – 9 of 9

Page 1