efgcsum.h

Gambit 是一个游戏库理论软件

//
// $Source: /home/gambit/CVS/gambit/sources/nash/efgcsum.h,v $
// $Date: 2002/09/10 14:27:39 $
// $Revision: 1.5.2.1 $
//
// DESCRIPTION:
// Interface to algorithm to solve efgs via linear programming
//
// 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 EFGCSUM_H
#define EFGCSUM_H

#include "numerical/tableau.h"
#include "numerical/lpsolve.h"
#include "efgalgorithm.h"

template <class T> class efgLp : public efgNashAlgorithm {
private:
  T maxpay, minpay;
  int ns1,ns2,ni1,ni2;
  gList<BFS<T> > List;
  gList<Infoset *> isets1, isets2;

  void FillTableau(const EFSupport &,
		   gMatrix<T> &, const Node *, T ,int ,int , int ,int );
  void GetSolutions(const EFSupport &, gList<BehavSolution> &) const;
  int Add_BFS(/*const*/ LPSolve<T> &B);
  
  void GetProfile(const EFSupport &, gDPVector<T> &v, const BFS<T> &sol,
		  const Node *n, int s1,int s2) const;

public:
  efgLp(void);
  virtual ~efgLp() { }

  gText GetAlgorithm(void) const { return "Lp[EFG]"; }
  gList<BehavSolution> Solve(const EFSupport &, gStatus &);
};


#endif    // EFGCSUM_H