A simulation framework for analyzing complex infinitely repeated games

Matthias Feldotto, Alexander Skopalik

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)
3 Downloads (Pure)

Abstract

We discuss a technique to analyze complex infinitely repeated games using techniques from the fields of game theory and simulations. Our research is motivated by the analysis of electronic markets with thousands of participants and possibly complex strategic behavior. We consider an example of a global market of composed IT services to demonstrate the use of our simulation technique. We present our current work in this area and we want to discuss further approaches for the future.

Original languageEnglish
Title of host publicationSIMULTECH 2014 - Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications
EditorsMohammad S. Obaidat, Janusz Kacprzyk, Tuncer Oren
PublisherSCITEPRESS
Pages625-630
ISBN (Electronic)9789897580383
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications, SIMULTECH 2014 - Vienna, Austria
Duration: 28 Aug 201430 Aug 2014

Publication series

NameProceedings of the International Conference on Simulation and Modeling Methodologies, Technologies and Applications - SIMULTECH
Volume2014
ISSN (Print)2184-2841

Conference

Conference4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications, SIMULTECH 2014
Country/TerritoryAustria
CityVienna
Period28/08/1430/08/14

Keywords

  • Algorithmic game theory
  • Composed services
  • Electronic market
  • Evolutionary game theory
  • Infinitely repeated games
  • Reputation system
  • Simulations
  • Stochastic games

Fingerprint

Dive into the research topics of 'A simulation framework for analyzing complex infinitely repeated games'. Together they form a unique fingerprint.

Cite this