All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Using the HELEF Language to Model the Strategic Games

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F06%3APU66963" target="_blank" >RIV/00216305:26230/06:PU66963 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Using the HELEF Language to Model the Strategic Games

  • Original language description

    The paper deals with a specialised view at the HELEF language, now pointed to modelling of<br> strategic games by meaning of Game Theory. Solving the<br> strategy games requires an extreme number of computing iterations where certain (generally unknown)subset<br> of iterations is repeated with no new information and so redundant. We employ a special feature of the HELEF language called Automatic Information<br> 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.<br> The problem is demonstrated on a simple competition two-player game on a market with some<br> general commodity.

  • Czech name

    Použití jazyka HELEF pro modelování strategických her

  • Czech description

    The paper deals with a specialised view at the HELEF language, now pointed to modelling of<br> strategic games by meaning of Game Theory. Solving the<br> strategy games requires an extreme number of computing iterations where certain (generally unknown)subset<br> of iterations is repeated with no new information and so redundant. We employ a special feature of the HELEF language called Automatic Information<br> 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.<br> The problem is demonstrated on a simple competition two-player game on a market with some<br> general commodity.

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JC - Computer hardware and software

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GP102%2F06%2FP309" target="_blank" >GP102/06/P309: Research in methodology of modelling and simulation of intelligent systems</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2006

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of XXVIIIth International Autumn Colloquium ASIS 2006: Advanced Simulation of Systems

  • ISBN

    80-86840-26-3

  • ISSN

  • e-ISSN

  • Number of pages

    7

  • Pages from-to

    121-127

  • Publisher name

    NEUVEDEN

  • Place of publication

    Ostrava

  • Event location

    Vranov (u Brna)

  • Event date

    Sep 12, 2006

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article