Name
Abstract | ||
|---|---|---|
This paper is a contribution to the theoretical foundations of strategies. We first present a general definition of abstract strategies which is extensional in the sense that a strategy is defined explicitly as a set of derivations of an abstract reduction system. We then move to a more intensional definition supporting the abstract view but more operational in the sense that it describes a means for determining such a set. We characterize the class of extensional strategies that can be defined intensionally. We also give some hints towards a logical characterization of intensional strategies and propose a few challenging perspectives. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.4204/EPTCS.15.1 | ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE |
Keywords | Field | DocType |
game theory,programming language | Genus–differentia definition,Mathematical economics,Computer science,Algorithm,Intensional logic,Extensional definition,Calculus | Journal |
Volume | Issue | ISSN |
abs/1001.4 | 15 | 2075-2180 |
Citations | PageRank | References |
5 | 0.45 | 33 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tony Bourdier | 1 | 14 | 1.27 |
| Horatiu Cirstea | 2 | 164 | 15.93 |
| Daniel J. Dougherty | 3 | 413 | 32.13 |
| Hélène Kirchner | 4 | 1655 | 152.66 |