A logical characterization of extensive games with short sight

No Thumbnail Available
File version
Author(s)
Liu, Chanjuan
Liu, Fenrong
Su, Kaile
Zhu, Enqiang
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2016
Size
File type(s)
Location
License
Abstract

The notion of short sight, introduced by Grossi and Turrini, weakens the unrealistic assumption in traditional extensive games that every player is able to perceive the entire game structure. In this paper, we propose a more general model for extensive games with short sight. For reasoning about extensive games with short sight, we propose a new logic language and then present an axiomatization for this logic. We prove the soundness and completeness of the axiomatization. In addition, we show that the logic can formally characterize the solution concepts and Pearce's lemma in games with short sight.

Journal Title

Theoretical Computer Science

Conference Title
Book Title
Edition
Volume

612

Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Mathematical sciences

Science & Technology

Computer Science, Theory & Methods

Game theory

Persistent link to this record
Citation

Liu, C; Liu, F; Su, K; Zhu, E, A logical characterization of extensive games with short sight, Theoretical Computer Science, 2016, 612, pp. 63-82

Collections