• Aucun résultat trouvé

Logics for Non-Cooperative Games with Expectations

N/A
N/A
Protected

Academic year: 2021

Partager "Logics for Non-Cooperative Games with Expectations"

Copied!
17
0
0

Texte intégral

Loading

Figure

Table 1 shows the payoff matrix for this generalised version of Matching Pennies with k = 5 (the values in each cell correspond to the first and second player payoffs under the valuation to the variables p 1 , p 2 ).

Références

Documents relatifs

In [6], Mundici develops a model of the Rényi - Ulam searching games with lies in terms of Łukasiewicz logic and MV- algebras.. A detective has to guess this number by asking

It is shown that if a game has a complete communication structure, then the proposed solution coincides with the Shapley value, and that if the game has a cycle-free

Suppose that the Italian News context C in contains the facts that Rooney does not take part to the Italian league in 2010, i.e., ¬> i (Rooney), and that he is not considered a

For minimizing the number of conflicts as well as the number of inferences invalidated we are currently investigating qualitative measures based on the entropy of a possible

Horn DLs have been introduced as syntactically defined fragments of stan- dard DLs that fall within the Horn fragment of first-order logic (henceforth Horn FO) and for

The translation remains correct if we replace all closed specifiers by open specifiers, since the translated knowledge base admits a least model where all annotation sets

We in- vestigate the combined complexity of reasoning in the presence of a given fixed domain for a wide range of description logics, for which we establish tight bounds for

Concerning the second assumption, we will show that by letting individual reason by classical logic, as in the standard Judgment Aggregation setting, and by interpreting