Gotowa bibliografia na temat „Repeated Matchings”

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Repeated Matchings”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Repeated Matchings"

1

Friedman, Daniel, and Ryan Oprea. "A Continuous Dilemma." American Economic Review 102, no. 1 (2012): 337–63. http://dx.doi.org/10.1257/aer.102.1.337.

Pełny tekst źródła
Streszczenie:
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)
Style APA, Harvard, Vancouver, ISO itp.
2

Serafine, Mary Louise, Noah Glassman, and Cornell Overbeeke. "The Cognitive Reality of Hierarchic Structure in Music." Music Perception 6, no. 4 (1989): 397–430. http://dx.doi.org/10.2307/40285440.

Pełny tekst źródła
Streszczenie:
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.
Style APA, Harvard, Vancouver, ISO itp.
3

López-Ortiz, Alejandro. "Linear pattern matching of repeated substrings." ACM SIGACT News 25, no. 3 (1994): 114–21. http://dx.doi.org/10.1145/193820.193842.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Wark, Peter, John Holt, Mikael Rönnqvist, and David Ryan. "Aircrew schedule generation using repeated matching." European Journal of Operational Research 102, no. 1 (1997): 21–35. http://dx.doi.org/10.1016/s0377-2217(96)00225-1.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Honhon, Dorothée, and Kyle Hyndman. "Flexibility and Reputation in Repeated Prisoner’s Dilemma Games." Management Science 66, no. 11 (2020): 4998–5014. http://dx.doi.org/10.1287/mnsc.2019.3495.

Pełny tekst źródła
Streszczenie:
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.
Style APA, Harvard, Vancouver, ISO itp.
6

Mingyan Wang, Mingyan Wang, Qingrong Huang Mingyan Wang, Nan Wu Qingrong Huang, and Ying Pan Nan Wu. "RDF Subgraph Matching by Means of Star Decomposition." 網際網路技術學刊 23, no. 7 (2022): 1613–21. http://dx.doi.org/10.53106/160792642022122307015.

Pełny tekst źródła
Streszczenie:
<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>
Style APA, Harvard, Vancouver, ISO itp.
7

Schumacher, Heiner. "On Repeated Games with Endogenous Matching Decision." Journal of Institutional and Theoretical Economics 171, no. 3 (2015): 544. http://dx.doi.org/10.1628/093245615x14302136524716.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Bishop, Nicholas, Hau Chan, Debmalya Mandal, and Long Tran-Thanh. "Sequential Blocked Matching." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 5 (2022): 4834–42. http://dx.doi.org/10.1609/aaai.v36i5.20411.

Pełny tekst źródła
Streszczenie:
We consider a sequential blocked matching (SBM) model where strategic agents repeatedly report ordinal preferences over a set of services to a central planner. The planner's goal is to elicit agents' true preferences and design a policy that matches services to agents in order to maximize the expected social welfare with the added constraint that each matched service can be blocked or unavailable for a number of time periods. Naturally, SBM models the repeated allocation of reusable services to a set of agents where each allocated service becomes unavailable for a fixed duration. We first consider the offline SBM setting, where the strategic agents are aware of their true preferences. We measure the performance of any policy by distortion, the worst-case multiplicative approximation guaranteed by any policy. For the setting with s services, we establish lower bounds of Ω(s) and Ω(√s) on the distortions of any deterministic and randomised mechanisms, respectively. We complement these results by providing approximately truthful, measured by incentive ratio, deterministic and randomised policies based on random serial dictatorship which match our lower bounds. Our results show that there is a significant improvement if one considers the class of randomised policies. Finally, we consider the online SBM setting with bandit feedback where each agent is initially unaware of her true preferences, and the planner must facilitate each agent in the learning of their preferences through the matching of services over time. We design an approximately truthful mechanism based on the explore-then-commit paradigm, which achieves logarithmic dynamic approximate regret.
Style APA, Harvard, Vancouver, ISO itp.
9

Kim, Hee Chun. "Repeated Two-Sided Matching with Multi-Attribute Preference." Korean Journal of Industrial Organization 27, no. 4 (2019): 87–121. http://dx.doi.org/10.36354/kjio.27.4.3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Xu, Zhenzhen, and John D. Kalbfleisch. "Repeated Randomization and Matching in Multi-Arm Trials." Biometrics 69, no. 4 (2013): 949–59. http://dx.doi.org/10.1111/biom.12077.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!