simpdiv.h

Gambit 是一个游戏库理论软件

//
// $Source: /home/gambit/CVS/gambit/sources/nash/simpdiv.h,v $
// $Date: 2002/09/10 14:27:45 $
// $Revision: 1.4.2.1 $
//
// DESCRIPTION:
// Compute Nash equilibria via simplicial subdivision on the normal form
//
// 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.
//

#ifndef SIMPDIV_H
#define SIMPDIV_H

#include "nfgalgorithm.h"

template <class T> class nfgSimpdiv : public nfgNashAlgorithm {
private:
  int m_nRestarts, m_leashLength;

  int t, ibar;
  T pay,d,maxz,bestz,mingrid;

  T Simplex(MixedProfile<T> &);
  T getlabel(MixedProfile<T> &yy, gArray<int> &, gPVector<T> &);
  void update(gRectArray<int> &, gRectArray<int> &, gPVector<T> &,
	      const gPVector<int> &, int j, int i);
  void getY(MixedProfile<T> &x, gPVector<T> &, 
	    const gPVector<int> &, const gPVector<int> &, 
	    const gPVector<T> &, const gRectArray<int> &, int k);
  void getnexty(MixedProfile<T> &x, const gRectArray<int> &,
		const gPVector<int> &, int i);
  int get_c(int j, int h, int nstrats, const gPVector<int> &);
  int get_b(int j, int h, int nstrats, const gPVector<int> &);
  
public:
  nfgSimpdiv(void);
  virtual ~nfgSimpdiv();

  int NumRestarts(void) const { return m_nRestarts; }
  void SetNumRestarts(int p_nRestarts) { m_nRestarts = p_nRestarts; }

  int LeashLength(void) const { return m_leashLength; }
  void SetLeashLength(int p_leashLength) { m_leashLength = p_leashLength; }

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

#endif  // SIMPDIV_H