Academic literature on the topic 'Repeated Matchings'

We study prisoners' dilemmas played in continuous time with flow payoffs accumulated over 60 seconds. In most cases, the median rate of mutual cooperation is about 90 percent. Control sessions with repeated matchings over eight subperiods achieve less than half as much cooperation, and cooperation rates approach zero in one-shot sessions. In follow-up sessions with a variable number of subperiods, cooperation rates increase nearly linearly as the grid size decreases, and, with one-second subperiods, they approach continuous levels. Our data support a strand of theory that explains how capacity to respond rapidly stabilizes cooperation and destabilizes defection in the prisoner's dilemma. (JEL C72, C78, C91)

Six experiments examined the cognitive reality of hierarchic structure in music. The first experiment showed that subjects were only moderately able to match a performed rendition of a hierarchic structure to the piece of music from which it was derived, with performance slightly better than chance. Metric accent emerged as a significant predictor of the tones perceived by subjects as structurally important. The second experiment showed that subjects' correct matchings were unlikely to be based on aesthetic preference, because performed renditions of (rule-governed) structures were not regarded as aesthetically preferable to nonstructures. The third experiment attempted to increase subjects' matching of structures and their original pieces through various task modifications, but these modifications did not increase performance over the success rate achieved in Experiment 1. Three additional experiments determined whether evidence of the distinction between structureand surface could be obtained in various similarity judgment tasks. Pairs of musical fragments were composed so that the members of each pair embodied (1) the same structure and same surface harmony, or (2) the same structure but different surface harmony, or (3) a different structure but same surface harmony. The rating task used in Experiments 4 and 5 showed that the members of Type-2 pairs of fragments were perceived to be just as similar as the members of Type-1 pairs, but Type-3 pairs were rated significantly lower in similarity. Thus, similarity judgments were based on underlying hierarchic structure, even in the face of radical harmony differences on the surface. This effect increased in strength with repeated hearing. The results support the cognitive reality of hierarchic structure, but are influenced by the type of perception used in a particular similarity judgment task and by the experience of repeated hearings.

We study how three matching institutions, differing in how relationships are dissolved, affect cooperation in a repeated prisoner’s dilemma and how cooperation rates are affected by the presence of a reputation mechanism. Although cooperation is theoretically sustainable under all institutions, we show experimentally that cooperation rates are lowest under random matching, highest under fixed matching, and intermediate in a flexible matching institution, where subjects have the option to dissolve relationships. Our results also suggest important interactions between the matching institution and reputation mechanism. Under both the random matching and flexible matching institutions, both subjective (based on subjects’ ratings) and objective (based on subjects’ actions) reputation mechanisms lead to substantial increases in cooperative behavior. However, under fixed matching, only the subjective reputation mechanism leads to higher cooperation. We argue that these differences are due to different reputation mechanisms being more forgiving of early deviations from cooperation under certain matching institutions, which gives subjects the ability to learn the value of cooperation rather than getting stuck with a bad reputation and, consequently, uncooperative relationships. This paper was accepted by Yan Chen, decision analysis.

<p>With the continuous development of the network, the scale of RDF data is becoming larger and larger. In the face of large-scale RDF data processing, the traditional database query method has been unable to meet the needs. Due to the limited characteristics of subgraph matching, most existing algorithms often have the phenomenon that many subgraphs are repeatedly traversed during the query process, resulting in a large number of intermediate result sets and low query efficiency. The core problem to be solved is how to efficiently match subgraphs. In order to improve the query efficiency of RDF subgraphs in massive RDF data graphs and solve the problem of repeated calculation of some graphs in the query process of RDF subgraphs, an RDF subgraph query algorithm based on star decomposition is proposed in this paper. The algorithm uses graph structure to decompose RDF subgraphs into stars and uses a custom node cost model to calculate the query order of the star subgraphs. By decomposing, the amount of communication among subgraphs is reduced, and the communication cost for query processing is lowered. Moreover, utilizing the query order for RDF subgraph matching can effectively reduce the generation of intermediate result sets and accelerate the efficiency of subgraph matching. On this basis, the performances of the proposed algorithm and several other widely used algorithms are compared and analyzed on two different datasets. Experiments show that the proposed algorithm has better advantages in database recreation, memory size, and execution efficiency. </p> <p> </p>