nfgutils.cc

来自「Gambit 是一个游戏库理论软件」· CC 代码 · 共 150 行

//
// $Source: /home/gambit/CVS/gambit/sources/game/nfgutils.cc,v $
// $Date: 2002/08/26 05:50:10 $
// $Revision: 1.2 $
//
// DESCRIPTION:
// Utility functions for normal form games
//
// 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.
//

#include "base/gmisc.h"
#include "nfg.h"
#include "nfplayer.h"
#include "nfstrat.h"
#include "nfgciter.h"


Nfg *CompressNfg(const Nfg &nfg, const NFSupport &S)
{
  Nfg *N = new Nfg(S.NumStrats());
  
  N->SetTitle(nfg.GetTitle());

  for (int pl = 1; pl <= N->NumPlayers(); pl++)  {
    NFPlayer *player = N->Players()[pl];
    player->SetName(nfg.Players()[pl]->GetName());
    for (int st = 1; st <= N->NumStrats(pl); st++) 
      player->Strategies()[st]->SetName(S.Strategies(pl)[st]->Name());
  }

  for (int outc = 1; outc <= nfg.NumOutcomes(); outc++)  {
    NFOutcome *outcome = N->NewOutcome();

    outcome->SetName(nfg.Outcomes()[outc]->GetName());

    for (int pl = 1; pl <= N->NumPlayers(); pl++)
      N->SetPayoff(outcome, pl, nfg.Payoff(nfg.Outcomes()[outc], pl));
  }

  NfgContIter oiter(S);
  NFSupport newS(*N);
  NfgContIter niter(newS);
  
  do   {
    if (oiter.GetOutcome())
      niter.SetOutcome(N->Outcomes()[oiter.GetOutcome()->GetNumber()]);
    else
      niter.SetOutcome(0);

    oiter.NextContingency();
  }  while (niter.NextContingency());

  return N;
}

bool IsConstSum(const Nfg &nfg)
{
  int pl, index;
  gNumber cvalue = (gNumber) 0;

  if (nfg.NumOutcomes() == 0)  return true;

  for (pl = 1; pl <= nfg.NumPlayers(); pl++)
    cvalue += nfg.Payoff(nfg.outcomes[1], pl);

  for (index = 2; index <= nfg.outcomes.Length(); index++)  {
    gNumber thisvalue = (gNumber) 0;

    for (pl = 1; pl <= nfg.NumPlayers(); pl++)
      thisvalue += nfg.Payoff(nfg.outcomes[index], pl);

    if (thisvalue > cvalue || thisvalue < cvalue)
      return false;
  }
  
  return true;
}

gNumber MinPayoff(const Nfg &nfg, int player)
{
  int index, p, p1, p2;
  gNumber minpay;
  
  if (nfg.NumOutcomes() == 0)  return (gNumber) 0;

  if (player)
    p1 = p2 = player;
  else   {
    p1 = 1;
    p2 = nfg.NumPlayers();
  }

  minpay = nfg.Payoff(nfg.outcomes[1], p1);
  for (index = 2; index <= nfg.outcomes.Length(); index++)  {
    for (p = p1; p <= p2; p++)
      if (nfg.Payoff(nfg.outcomes[index], p) < minpay)
	minpay = nfg.Payoff(nfg.outcomes[index], p);
  }
  return minpay;
}

gNumber MaxPayoff(const Nfg &nfg, int player)
{
  int index, p, p1, p2;
  gNumber maxpay;

  if (nfg.NumOutcomes() == 0)  return (gNumber) 0;

  if (player)
    p1 = p2 = player;
  else   {
    p1 = 1;
    p2 = nfg.NumPlayers();
  }

  maxpay = nfg.Payoff(nfg.outcomes[1], p1);
  for (index = 2; index <= nfg.outcomes.Length(); index++)  {
    for (p = p1; p <= p2; p++)
      if (nfg.Payoff(nfg.outcomes[index], p) > maxpay)
	maxpay = nfg.Payoff(nfg.outcomes[index], p);
  }
  return maxpay;
}

void RandomNfg(Nfg &nfg)
{
  for (int pl = 1; pl <= nfg.NumPlayers(); pl++)
    for (int outc = 1; outc <= nfg.outcomes.Length(); outc++)
      nfg.SetPayoff(nfg.outcomes[outc], pl, gNumber(Uniform()));
}