Evolving payoff functions in Bayesian games with genetic programming

DOI10.1016/J.IJAR.2026.109746MaRDI QIDQ7308926zbMATH OpenFDO

Authors Mihai Alexandru Suciu, Rodica Ioana Lung

Publication date 4 August 2026

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IJAR.2026.109746

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Games with incomplete information, Bayesian games (91A27)

Cites work

• A generalized approach to solve perfect Bayesian Nash equilibrium for practical network attack and defense
• Automated multi-objective system identification using grammar-based genetic programming
• Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming
• Bayesian Nash equilibrium and variational inequalities
• Bayesian Nash equilibrium in “linear” Cournot models with private information about costs
• Bayesian Nash equilibrium seeking for multi-agent incomplete-information aggregative games
• Bayesian-Nash equilibria in theory of planned behaviour
• Cartesian genetic programming.
• Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types
• Existence and approximation of continuous Bayesian Nash equilibria in games with continuous type and action spaces
• Game theory and mechanism design
• Game theory. Translated from the Hebrew by Ziv Hellman and edited by Mike Borns
• Generalized Bayesian Nash equilibrium with continuous type and action spaces
• scientific article; zbMATH DE number 5301288 (Why is no real title available?)
• scientific article; zbMATH DE number 1966911 (Why is no real title available?)
• scientific article; zbMATH DE number 795588 (Why is no real title available?)
• scientific article; zbMATH DE number 2202844 (Why is no real title available?)
• Julia: a fresh approach to numerical computing
• Linear Genetic Programming
• Networks, crowds and markets. Reasoning about a highly connected world.
• On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions
• Simplification of genetic programs: a literature survey
• The return function: a new computable perspective on Bayesian-Nash equilibria

This page was built for publication: Evolving payoff functions in Bayesian games with genetic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7308926)