Detail publikace

Using the HELEF Language to Model the Strategic Games

HRUBÝ, M.

Originální název

Using the HELEF Language to Model the Strategic Games

Anglický název

Using the HELEF Language to Model the Strategic Games

Jazyk

en

Originální abstrakt

The paper deals with a specialised view at the HELEF language, now pointed to modelling of strategic games by meaning of Game Theory. Solving the strategy games requires an extreme number of computing iterations where certain (generally unknown) subset of iterations is repeated with no new information and so redundant. We employ a special feature of the HELEF language called Automatic Information Net (AIN) to model the whole computation itself, so then by using AIN we can predict what subset of iterations is not needed for the game's solution. The problem is demonstrated on a simple competition two-player game on a market with some general commodity.

Anglický abstrakt

The paper deals with a specialised view at the HELEF language, now pointed to modelling of strategic games by meaning of Game Theory. Solving the strategy games requires an extreme number of computing iterations where certain (generally unknown) subset of iterations is repeated with no new information and so redundant. We employ a special feature of the HELEF language called Automatic Information Net (AIN) to model the whole computation itself, so then by using AIN we can predict what subset of iterations is not needed for the game's solution. The problem is demonstrated on a simple competition two-player game on a market with some general commodity.

Dokumenty

BibTex


@inproceedings{BUT22259,
  author="Martin {Hrubý}",
  title="Using the HELEF Language to Model the Strategic Games",
  annote="The paper deals with a specialised view at the HELEF language, now pointed to
modelling of
strategic games by meaning of Game Theory. Solving the
strategy games requires an extreme number of computing iterations where certain
(generally unknown) subset
of iterations is repeated with no new information and so redundant. We employ a
special feature of the HELEF language called Automatic Information
Net (AIN) to model the whole computation itself, so then by using AIN we can
predict what subset of iterations is not needed for the game's solution.
The problem is demonstrated on a simple competition two-player game on a market
with some
general commodity.",
  booktitle="Proceedings of XXVIIIth International Autumn Colloquium ASIS 2006: Advanced Simulation of Systems",
  chapter="22259",
  year="2006",
  month="september",
  pages="121--126",
  type="conference paper"
}