• myGriffith
    • Staff portal
    • Contact Us⌄
      • Future student enquiries 1800 677 728
      • Current student enquiries 1800 154 055
      • International enquiries +61 7 3735 6425
      • General enquiries 07 3735 7111
      • Online enquiries
      • Staff phonebook
    View Item 
    •   Home
    • Griffith Research Online
    • Journal articles
    • View Item
    • Home
    • Griffith Research Online
    • Journal articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

  • All of Griffith Research Online
    • Communities & Collections
    • Authors
    • By Issue Date
    • Titles
  • This Collection
    • Authors
    • By Issue Date
    • Titles
  • Statistics

  • Most Popular Items
  • Statistics by Country
  • Most Popular Authors
  • Support

  • Contact us
  • FAQs
  • Admin login

  • Login
  • A logical characterization of extensive games with short sight

    Author(s)
    Liu, Chanjuan
    Liu, Fenrong
    Su, Kaile
    Zhu, Enqiang
    Griffith University Author(s)
    Su, Kaile
    Year published
    2016
    Metadata
    Show full item record
    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.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.
    View less >
    Journal Title
    Theoretical Computer Science
    Volume
    612
    DOI
    https://doi.org/10.1016/j.tcs.2015.10.015
    Subject
    Mathematical Sciences
    Information and Computing Sciences
    Science & Technology
    Computer Science, Theory & Methods
    Game theory
    Publication URI
    http://hdl.handle.net/10072/400966
    Collection
    • Journal articles

    Footer

    Disclaimer

    • Privacy policy
    • Copyright matters
    • CRICOS Provider - 00233E

    Tagline

    • Gold Coast
    • Logan
    • Brisbane - Queensland, Australia
    First Peoples of Australia
    • Aboriginal
    • Torres Strait Islander