enum.h

来自「Gambit 是一个游戏库理论软件」· C头文件 代码 · 共 66 行

//
// $Source: /home/gambit/CVS/gambit/sources/nash/enum.h,v $
// $Date: 2002/09/10 14:27:40 $
// $Revision: 1.4.2.1 $
//
// DESCRIPTION:
// Compute Nash equilibria via Mangasarian's algorithm
//
// This file is part of Gambit
// Copyright (c) 2002, The Gambit Project
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
//

//
// Enum implements the procedure described in 
// Mangasarian, O. L., "Equilibrium points of bimatrix games", 
// SIAM 12 (1964): 778-780 for finding all extreme points of 
// the Nash equilibrium components of a two person game. 
// 

#ifndef ENUM_H
#define ENUM_H

#include "nfgalgorithm.h"

template <class T> class nfgEnumMixed : public nfgNashAlgorithm {
private:
  int m_stopAfter;
  bool m_cliques;

  // Private auxiliary functions
  bool EqZero(const T &) const;

public:
  nfgEnumMixed(void);
  virtual ~nfgEnumMixed() { }
  
  int StopAfter(void) const { return m_stopAfter; }
  void SetStopAfter(int p_stopAfter) { m_stopAfter = p_stopAfter; }

  bool Cliques(void) const { return m_cliques; }
  void SetCliques(bool p_cliques) { m_cliques = p_cliques; }

  gText GetAlgorithm(void) const { return "EnumMixed[NFG]"; }
  gList<MixedSolution> Solve(const NFSupport &, gStatus &);
};

#endif  // ENUM_H