use crate::error::Result;
use crate::game::Domain;
use crate::game::ExplicitGame;
use crate::games::bankruptcy::BankruptcyGame;
use crate::games::graph::InducedSubgraphGame;
use crate::games::voting::WeightedVotingGame;
use crate::nucleolus;
use crate::nucleolus::convex;
use crate::properties::ConvexChecked;
use crate::solution::{Guarantee, Property, Solution};
pub const EXPLICIT_LP_LIMIT: usize = 16;
pub trait AutoNucleolus {
fn nucleolus_auto(&self) -> Result<Solution>;
}
impl AutoNucleolus for ExplicitGame {
fn nucleolus_auto(&self) -> Result<Solution> {
Ok(nucleolus::nucleolus(self)?.into_solution(Domain::Imputation, "sequential-lp"))
}
}
impl AutoNucleolus for ConvexChecked {
fn nucleolus_auto(&self) -> Result<Solution> {
if self.game().players() <= EXPLICIT_LP_LIMIT {
self.game().nucleolus_auto()
} else {
convex::nucleolus(self)
}
}
}
impl AutoNucleolus for BankruptcyGame {
fn nucleolus_auto(&self) -> Result<Solution> {
Ok(Solution {
domain: Domain::Imputation,
allocation: self.nucleolus()?,
guarantee: Guarantee::Proven(Property::Bankruptcy),
method: "talmud-rule",
})
}
}
impl AutoNucleolus for WeightedVotingGame {
fn nucleolus_auto(&self) -> Result<Solution> {
Ok(nucleolus::oracle::nucleolus(self)?
.into_solution(Domain::Imputation, "oracle-constraint-generation"))
}
}
impl AutoNucleolus for InducedSubgraphGame {
fn nucleolus_auto(&self) -> Result<Solution> {
convex::nucleolus(self)
}
}