Struct FictitiousPlayMetaSolver 

pub struct FictitiousPlayMetaSolver { /* private fields */ }

Fictitious-play meta-solver.

Deterministic: each iteration, the row-player best-responds to the column-player’s empirical mixture, the column-player best-responds to the row-player’s empirical mixture, and both empirical mixtures are updated. After iterations rounds the empirical row mixture converges to the Nash on zero-sum games (Brown 1951, Robinson 1951). No external LP dependency.

Tuning

The default iterations = 1000 is overkill for n ≤ 8 but cheap (each step is O(n²)). For very small empirical games this is equivalent to (and slightly more robust than) ReplicatorDynamicsMetaSolver.

Implementations

impl FictitiousPlayMetaSolver

pub fn new(iterations: usize) -> Self

Construct with iterations fictitious-play rounds.

Trait Implementations

impl Clone for FictitiousPlayMetaSolver

fn clone(&self) -> FictitiousPlayMetaSolver

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for FictitiousPlayMetaSolver

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for FictitiousPlayMetaSolver

fn default() -> Self

Returns the “default value” for a type.

impl MetaSolver for FictitiousPlayMetaSolver

fn solve(&self, payoffs: &[Vec<f32>]) -> Vec<f32>

Solve for the row-player mixed-Nash on a symmetric n × n empirical payoff matrix.

fn name(&self) -> &'static str

Human-readable name for diagnostics / logging.

fn solve_n_player( &self, _payoffs: &[Vec<f32>], num_agents: usize, _per_role_k: usize, ) -> Vec<f32>

N-player solve over an explicit per-agent payoff tensor.