Reputation games for undirected graphs

New relationships are often plagued with uncertainty because one of the players has some private information about her “type.” The reputation literature has shown that equilibria that reveal this private information typically involve breach of trust and conflict. But are these inevitable for equilibrium learning? I analyze self-enforcing relationships where one party is privately informed about her time preferences. I show that there always exist honest reputation equilibria, which fully reveal information and support cooperation without breach or conflict. I compare these to dishonest reputation equilibria from several perspectives. My results are applicable to a broad class of repeated games. (JEL C73, D82, D83, D86, Z13)

Download Full-text

All-pairs shortest paths for unweighted undirected graphs in o ( mn ) time

ACM Transactions on Algorithms ◽

10.1145/2344422.2344424 ◽

2012 ◽

Vol 8 (4) ◽

pp. 1-17 ◽

Cited By ~ 13

Author(s):

Timothy M. Chan

Keyword(s):

Shortest Paths ◽

Undirected Graphs ◽

All Pairs Shortest Paths

Download Full-text

Associative spectra of graph algebras I

Journal of Algebraic Combinatorics ◽

10.1007/s10801-020-01010-w ◽

2021 ◽

Author(s):

Erkko Lehtonen ◽

Tamás Waldhauser

Keyword(s):

Catalan Numbers ◽

Graph Algebras ◽

Undirected Graphs ◽

Powers Of 2

AbstractAssociative spectra of graph algebras are examined with the help of homomorphisms of DFS trees. Undirected graphs are classified according to the associative spectra of their graph algebras; there are only three distinct possibilities: constant 1, powers of 2, and Catalan numbers. Associative and antiassociative digraphs are described, and associative spectra are determined for certain families of digraphs, such as paths, cycles, and graphs on two vertices.

Download Full-text

From undirected graphs to directed graphs: a new technique makes it possible for multi-agent systems

Journal of Control and Decision ◽

10.1080/23307706.2021.1965047 ◽

2021 ◽

pp. 1-3

Author(s):

Jilie Zhang ◽

Tao Feng

Keyword(s):

Directed Graphs ◽

New Technique ◽

Multi Agent Systems ◽

Undirected Graphs ◽

Agent Systems ◽

Multi Agent ◽

A New Technique

Download Full-text

A Web-Based Tool for Visualization of Biomolecular Network Comparison

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.556-562.5482 ◽

2014 ◽

Vol 556-562 ◽

pp. 5482-5487

Author(s):

Hui Ran Zhang ◽

Xiao Long Shen ◽

Jiang Xie ◽

Dong Bo Dai

Keyword(s):

Open Source ◽

Undirected Graphs ◽

Web Based ◽

Network Comparison ◽

Biomolecular Networks ◽

Biomolecular Network ◽

Visualization Tools ◽

Similarities And Differences ◽

Adaptive Visualization

Analyzing similarities and differences between biomolecular networks comparison through website intuitively could be a convenient and effective way for researchers. Although several network comparison visualization tools have been developed, none of them can be integrated into websites. In this paper, a web-based tool kit named dynamically adaptive Visualization of Biomolecular Network Comparison (Bio-NCV) is designed and developed. The proposed tool is based on Cytyoscape.js – a popular open-source library for analyzing and visualizing networks. Bio-NCV integrates arjor.js which including the Barnes-Hut algorithm and the Traer Physics library for processing in order to express the dynamically adaptive initialization. In addition, in order to maintain consistency, the counterparts in other networks will change while the nodes and edges in one of the compared networks change. Furthermore, Bio-NCV can deal with both directed and undirected graphs.

Download Full-text