Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    A review on dependence graph in social reasoning mechanism

    Access Status
    Fulltext not available
    Authors
    Lau, Billy
    Singh, Ashutosh Kumar
    Tan, Terence Peng Lian
    Date
    2015
    Type
    Journal Article
    
    Metadata
    Show full item record
    Citation
    Lau, Billy Pik Lik, and Singh, Ashutosh Kumar and Tan, Terence Peng Lian. 2015. A review on dependence graph in social reasoning mechanism. Artificial Intelligence Review. 43 (2): pp. 229-242.
    Source Title
    Artificial Intelligence Review
    DOI
    10.1007/s10462-012-9371-x
    ISSN
    02692821
    URI
    http://hdl.handle.net/20.500.11937/24276
    Collection
    • Curtin Research Publications
    Abstract

    Dependence between heterogeneous agents has gained attention from researchers because dependence influences the capabilities of a particular agent in a multi-agent system. In this paper, we have reviewed and discussed the dependence graph which is also known as interdependence graph in some author’s work. Dependence graph is originally proposed in the social reasoning mechanism to visualize the dependence network. In this paper, dependence network is explained and an in depth analysis of the dependence graph is presented as well. Next, we are going to discuss about the social phenomena and group formation of the dependence graph. In addition, the further works of other authors are listed in this paper. Also, we discuss the drawbacks and propose some potential solution for enhancing the dependence graph.

    Related items

    Showing items related by title, author, creator and subject.

    • Graphs that are critical with respect to matching extension and diameter
      Ananchuen, Nawarat (1994)
      Let G be a simple connected graph on 2n vertices with a perfect matching. For 1 ≤ k ≤ n - 1, G is said to be k-extendable if for every matching M of size k in G there is a perfect matching in G containing all the edges ...
    • Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs
      Kawamura, S.; Cai, K.; Ye, Mengbin ; Lin, Z. (2020)
      © 2018 Informa UK Limited, trading as Taylor & Francis Group. We study a continuous-time surplus-based algorithm for multi-agent average consensus, and derive a tight upper bound on the key parameter included in this ...
    • Properties of wealth distribution in multi-agent systems of a complex network
      Hu, Mao-Bin; Jiang, R.; Wu, Yong-Hong; Wang, R.; Wu, Q. (2008)
      We present a simple model for examining the wealth distribution with agents playing evolutionary games (the Prisoners' Dilemma and the Snowdrift Game) on complex networks. Pareto's power law distribution of wealth (from ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.