English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/133452
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


Logics for Non-Cooperative Games with Expectations

AuthorsGodo, Lluis ; Marchioni, Enrico
KeywordsStrategic choice
Discrete polynomials
Noncooperative game
Payoff function
Complexity results
Issue Date12-Dec-2013
Citation11th European Workshop on Multi-Agent Systems, EUMAS 2013; Toulouse; France; December 12-13, 2013. CEUR Workshop Proceedings, vol. 1113, 2013, pp. 82-96.
AbstractWe introduce the logics E(G) for reasoning about probabilistic expectation over classes G of games with discrete polynomial payoff functions represented by finite-valued Lukasiewicz formulas and provide completeness and complexity results. In addition, we introduce a new class of games where players' expected payoff functions are encoded by E(G)-formulas. In these games each player's aim is to randomise her strategic choices in order to affect the other players' expectations over an outcome as well as their own. We offer a logical and computational characterisation of this new class of games.
Identifiersissn: 16130073
uri: http://ceur-ws.org/Vol-1113/
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
WS.EUMAS13_1113.82-96.pdf384,21 kBUnknownView/Open
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.