A game theoretic perspective on Bayesian many-objective optimization
From MaRDI portal
Cites work
- A Bayesian optimization approach to find Nash equilibria
- A survey of static and dynamic potential games
- An informational approach to the global optimization of expensive-to-evaluate functions
- Augmented Lagrangian methods for the solution of generalized Nash equilibrium problems
- Bargaining with endogenous disagreement: the extended Kalai-Smorodinsky solution
- Cooperation and competition in multidisciplinary optimization
- Distributed algorithms for the computation of noncooperative equilibria
- Fast update of conditional simulation ensembles
- scientific article; zbMATH DE number 3679573 (Why is no real title available?)
- scientific article; zbMATH DE number 3487202 (Why is no real title available?)
- Neumann-Dirichlet Nash strategies for the solution of elliptic Cauchy problems
- Nonconvex n-person bargaining: efficient maxmin solutions
- Nonlinear multiobjective optimization
- On relaxation algorithms in computation of noncooperative equilibria
- On the estimation of Pareto fronts from the point of view of copula theory
- On the likelihood that one unkrown probability exeeds another in view of the evidence of two samples.
- Other Solutions to Nash's Bargaining Problem
- Relaxation techniques and asynchronous algorithms for on-line computation of non-cooperative equilibria
- Targeting solutions in Bayesian multi-objective optimization: sequential and batch versions
- The bargaining problem without convexity. Extending the egalitarian and Kalai-Smorodinsky solutions
- The Kalai-Smorodinsky solution for many-objective Bayesian optimization
This page was built for publication: A game theoretic perspective on Bayesian many-objective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6914726)