Skip to main content
Powered by ShareScore

Find research datasets worth reusing

Search datasets from major research repositories and use ShareScore to quickly assess how well each record supports discovery, access, and reuse.

17

datasets available to search

ShareScore release 0.9.0

Reset

Dataset results

17 results for “Reputations”

Learn how ShareScore rates datasets ↗
zenodo44/100

A Reputation Game Simulation: Emergent Social Phenomena from Information Theory

<p>Here, the data underlying the article &quot;A Reputation Game Simulation: Emergent Social Phenomena from Information Theory&quot; (<a href="https://doi.org/10.1002/andp.202100277">https://doi.org/10.1002/andp.202100277</a>) is&nbsp;provided.<br> <br> The data is structured&nbsp;according to the figures it has&nbsp;been used for. There are</p> <ul> <li>example simulations with basic communication strategies in the folder&nbsp;&quot;single_simulations_3_agents&quot; (Figures 4,5,8,D1)</li> <li>statistical simulations with 3 agents and special communication strategies in the folder&nbsp;&quot;statistical_simulations_3_agents&quot; (Figures 9-13, the upper panel of figure 15, figures&nbsp;16-18,&nbsp;D2 and&nbsp;the left panels of figure D3)</li> <li>statistical simulations with 4&nbsp;agents and special communication strategies in the folder&nbsp;&quot;statistical_simulations_4_agents&quot; (Figure 14, the middle panel of figure 15,&nbsp;the middle panels of figure D3 and&nbsp;the upper panels of figures D4, D5)</li> <li>statistical simulations with 5&nbsp;agents and special communication strategies in the folder&nbsp;&quot;statistical_simulations_5_agents&quot; (The lower panel of figure 15, the right panels of figure D3 and the lower panels of figures D4,D5)</li> <li>propaganda&nbsp;simulations&nbsp;in&nbsp;the&nbsp;folder&nbsp;&quot;propaganda_simulations&quot;&nbsp;(Figure&nbsp;7)</li> </ul> <p><br> Each simulation is represented by a .json file in which all events that&nbsp;happened during the simulation are collected. Generally, there are&nbsp;three types of events: communications, self-updates (information that the speaker gained about itself is processed) and updates (information that the receiver gained about the speaker and the topic is processed). Additionally, the first line specifies&nbsp;the parameters of each simulation, and the last few lines summarize the final status of the simulation. In the following all important abbreviations are explained:</p> <ul> <li>parameters <ul> <li>decpeting:&nbsp;whether&nbsp;or&nbsp;not&nbsp;agents&nbsp;in&nbsp;generally&nbsp;make&nbsp;dishonest&nbsp;statements</li> <li>listening: whether or not agents in listen to their communication partners</li> <li>disturbing: whether or not agents are&nbsp;particularly risk-taking when making dishonest statements</li> <li>x_est:&nbsp;intrinsic&nbsp;honesties&nbsp;of&nbsp;the&nbsp;agents</li> <li>RSeed:&nbsp;the&nbsp;used&nbsp;random&nbsp;seed</li> <li>NA:&nbsp;number&nbsp;of&nbsp;agents</li> <li>NR:&nbsp;number&nbsp;of&nbsp;rounds</li> </ul> </li> <li>communication <ul> <li>a:&nbsp;speaker</li> <li>b:&nbsp;receiver</li> <li>c:&nbsp;topic</li> <li>J:&nbsp;transmitted&nbsp;message&nbsp;in&nbsp;the&nbsp;form&nbsp;of</li> </ul> </li> <li>self_update <ul> <li>id:&nbsp;number&nbsp;of&nbsp;agent&nbsp;who&nbsp;is&nbsp;updating&nbsp;knowledge&nbsp;about&nbsp;itself</li> <li>Nl, Nt: number of dishonest/honest statements the agent has observed from itself so far</li> <li>I_&lt;id&gt;: knowledge that the agents has about itself after the update in the form of</li> </ul> </li> <li>update <ul> <li>id:&nbsp;number&nbsp;of&nbsp;agent&nbsp;who&nbsp;is&nbsp;updating&nbsp;its&nbsp;knowledge</li> <li>I_&lt;id1&gt;: knowledge that the updating agent&nbsp;has about agent &lt;id1&gt;&nbsp;in the form of</li> <li>Jothers_&lt;id1&gt;_&lt;id2&gt;:&nbsp;last statement that the updating agent heared&nbsp;agent &lt;id1&gt; make about agent &lt;id2&gt;</li> <li>Iothers_&lt;id1&gt;_&lt;id2&gt;: what the updating agent believes that agent &lt;id1&gt; thinks about agent &lt;id2&gt; after the update</li> <li>Cothers_&lt;id1&gt;_&lt;id2&gt;: what the updating agent believes&nbsp;after the update that agent &lt;id1&gt; wants it to think&nbsp;about agent &lt;id2&gt;</li> <li>new_friends/enemies: id of the agent, the updating agent after the update considers&nbsp;a friend/enemy</li> <li>new_K: normalized surprise the updating agent experienced in the last communication (used to calculate kappa)</li> <li>kappa: median of the last ten normalized surprises the updating agent experienced</li> </ul> </li> <li>final_status <ul> <li>id/name:&nbsp;number&nbsp;if&nbsp;the&nbsp;described&nbsp;agent</li> <li>x:&nbsp;the&nbsp;agent&#39;s&nbsp;honesty</li> <li>I:&nbsp;the&nbsp;agent&#39;s&nbsp;knowledge&nbsp;about&nbsp;all&nbsp;others</li> <li>Nc/Nt/Nl: total number of conversations/honest statements/dishonest statements the agent has made</li> <li>K:&nbsp;the&nbsp;last&nbsp;10&nbsp;normalized&nbsp;surprises&nbsp;the&nbsp;agent&nbsp;experienced</li> <li>kappa:&nbsp;the&nbsp;median&nbsp;of&nbsp;K</li> <li>friends/enemies:&nbsp;list&nbsp;of&nbsp;the&nbsp;agent&#39;s&nbsp;friends/enemies</li> <li>Jothers/Iothers/Cothers: same as above, now as full array, i.e. the combined&nbsp;information about all others</li> <li>openess/mind/decepting/strategic/egocentric/deceptive/flattering/aggressive/shameless/disturbing: the agent&#39;s character traits</li> </ul> </li> </ul>

opencc-by-4.0Nov 2022View details →
zenodo40/100

Reputation Communication from an Information Perspective

<p>Here, the data underlying the article &quot;Reputation Communication from an Information Perspective&quot;&nbsp;is&nbsp;provided.<br> <br> There are two example simulations, one with 3 ordinary agents and one with a dominant agent among two ordinary agents. Each simulation is represented by a .json file in which all events that&nbsp;happened during the simulation are collected. Generally, there are&nbsp;three types of events: communications, self-updates (information that the speaker gained about itself is processed) and updates (information that the receiver gained about the speaker and the topic is processed). Additionally, the first line specifies&nbsp;the parameters of each simulation, and the last few lines summarize the final status of the simulation. In the following all important abbreviations are explained:</p> <ul> <li>parameters <ul> <li>decpeting:&nbsp;whether&nbsp;or&nbsp;not&nbsp;agents&nbsp;in&nbsp;generally&nbsp;make&nbsp;dishonest&nbsp;statements</li> <li>listening: whether or not agents in listen to their communication partners</li> <li>disturbing: whether or not agents are&nbsp;particularly risk-taking when making dishonest statements</li> <li>x_est:&nbsp;intrinsic&nbsp;honesties&nbsp;of&nbsp;the&nbsp;agents</li> <li>RSeed:&nbsp;the&nbsp;used&nbsp;random&nbsp;seed</li> <li>NA:&nbsp;number&nbsp;of&nbsp;agents</li> <li>NR:&nbsp;number&nbsp;of&nbsp;rounds</li> </ul> </li> <li>communication <ul> <li>a:&nbsp;speaker</li> <li>b:&nbsp;receiver</li> <li>c:&nbsp;topic</li> <li>J:&nbsp;transmitted&nbsp;message&nbsp;in&nbsp;the&nbsp;form&nbsp;of</li> </ul> </li> <li>self_update <ul> <li>id:&nbsp;number&nbsp;of&nbsp;agent&nbsp;who&nbsp;is&nbsp;updating&nbsp;knowledge&nbsp;about&nbsp;itself</li> <li>Nl, Nt: number of dishonest/honest statements the agent has observed from itself so far</li> <li>I_&lt;id&gt;: knowledge that the agents has about itself after the update in the form of</li> </ul> </li> <li>update <ul> <li>id:&nbsp;number&nbsp;of&nbsp;agent&nbsp;who&nbsp;is&nbsp;updating&nbsp;its&nbsp;knowledge</li> <li>I_&lt;id1&gt;: knowledge that the updating agent&nbsp;has about agent &lt;id1&gt;&nbsp;in the form of</li> <li>Jothers_&lt;id1&gt;_&lt;id2&gt;:&nbsp;last statement that the updating agent heared&nbsp;agent &lt;id1&gt; make about agent &lt;id2&gt;</li> <li>Iothers_&lt;id1&gt;_&lt;id2&gt;: what the updating agent believes that agent &lt;id1&gt; thinks about agent &lt;id2&gt; after the update</li> <li>Cothers_&lt;id1&gt;_&lt;id2&gt;: what the updating agent believes&nbsp;after the update that agent &lt;id1&gt; wants it to think&nbsp;about agent &lt;id2&gt;</li> <li>new_friends/enemies: id of the agent, the updating agent after the update considers&nbsp;a friend/enemy</li> <li>new_K: normalized surprise the updating agent experienced in the last communication (used to calculate kappa)</li> <li>kappa: median of the last ten normalized surprises the updating agent experienced</li> </ul> </li> <li>final_status <ul> <li>id/name:&nbsp;number&nbsp;if&nbsp;the&nbsp;described&nbsp;agent</li> <li>x:&nbsp;the&nbsp;agent&#39;s&nbsp;honesty</li> <li>I:&nbsp;the&nbsp;agent&#39;s&nbsp;knowledge&nbsp;about&nbsp;all&nbsp;others</li> <li>Nc/Nt/Nl: total number of conversations/honest statements/dishonest statements the agent has made</li> <li>K:&nbsp;the&nbsp;last&nbsp;10&nbsp;normalized&nbsp;surprises&nbsp;the&nbsp;agent&nbsp;experienced</li> <li>kappa:&nbsp;the&nbsp;median&nbsp;of&nbsp;K</li> <li>friends/enemies:&nbsp;list&nbsp;of&nbsp;the&nbsp;agent&#39;s&nbsp;friends/enemies</li> <li>Jothers/Iothers/Cothers: same as above, now as full array, i.e. the combined&nbsp;information about all others</li> <li>openess/mind/decepting/strategic/egocentric/deceptive/flattering/aggressive/shameless/disturbing: the agent&#39;s character traits</li> </ul> </li> </ul>

opencc-by-4.0Nov 2022View details →
zenodo40/100

Information and Agreement in the Reputation Game Simulation

<p>Here, the data underlying the article &quot;Information and Agreement in the Reputation Game Simulation&quot;&nbsp;is&nbsp;provided.<br> <br> There are 100 simulations with different random seeds to ensure statistically meaningful results. Each simulation is represented by a .json file in which all events that&nbsp;happened during the simulation are collected. Generally, there are&nbsp;three types of events: communications, self-updates (information that the speaker gained about itself is processed) and updates (information that the receiver gained about the speaker and the topic is processed). Additionally, the first line specifies&nbsp;the parameters of each simulation, and the last few lines summarize the final status of the simulation. In the following all important abbreviations are explained:</p> <ul> <li>first line <ul> <li>x_est:&nbsp;intrinsic&nbsp;honesties&nbsp;of&nbsp;the&nbsp;agents</li> <li>fr_affinities: intrinsic friendship affinity values&nbsp;of the agents</li> <li>shynesses: intrinsic shyness values of the agents</li> <li>perc_one_to_one: percentage of one-to-one conversations</li> <li>RSeed:&nbsp;the&nbsp;used&nbsp;random&nbsp;seed</li> <li>NA:&nbsp;number&nbsp;of&nbsp;agents</li> <li>NR:&nbsp;number&nbsp;of&nbsp;rounds</li> <li>mode: strategy used by the special agent</li> </ul> </li> <li>communication <ul> <li>a:&nbsp;speaker</li> <li>b_set: set of receivers. Can be either a single receiver&nbsp;or several</li> <li>c:&nbsp;topic</li> <li>J:&nbsp;transmitted&nbsp;message&nbsp;in&nbsp;the&nbsp;form&nbsp;of</li> </ul> </li> <li>self_update <ul> <li>id:&nbsp;number&nbsp;of&nbsp;agent&nbsp;who&nbsp;is&nbsp;updating&nbsp;knowledge&nbsp;about&nbsp;itself</li> <li>Nl, Nt: number of dishonest/honest statements the agent has observed from itself so far</li> <li>I_&lt;id&gt;: knowledge that the agents has about itself after the update in the form of</li> <li>Jothers_&lt;id1&gt;_&lt;id2&gt;:&nbsp;last statement that the updating agent heared&nbsp;agent &lt;id1&gt; make about agent &lt;id2&gt;</li> </ul> </li> <li>update <ul> <li>id:&nbsp;number&nbsp;of&nbsp;agent&nbsp;who&nbsp;is&nbsp;updating&nbsp;its&nbsp;knowledge</li> <li>I_&lt;id1&gt;: knowledge that the updating agent&nbsp;has about agent &lt;id1&gt;&nbsp;in the form of</li> <li>Jothers_&lt;id1&gt;_&lt;id2&gt;:&nbsp;last statement that the updating agent heared&nbsp;agent &lt;id1&gt; make about agent &lt;id2&gt;</li> <li>Iothers_&lt;id1&gt;_&lt;id2&gt;: what the updating agent believes that agent &lt;id1&gt; thinks about agent &lt;id2&gt; after the update</li> <li>Cothers_&lt;id1&gt;_&lt;id2&gt;: what the updating agent believes&nbsp;after the update that agent &lt;id1&gt; wants it to think&nbsp;about agent &lt;id2&gt;</li> <li>relationsc_&lt;id&gt;: number of conversations the updating agent has had with agent &lt;id&gt;</li> <li>relationsm_&lt;id&gt;: number of messages the updating agent received about agent &lt;id&gt;</li> <li>friendship+_to_&lt;id&gt;: the updating agent counts one friendly statement of agent &lt;id&gt;, i.e. the updating agent rates agent &lt;id&gt; now a little more as a friend</li> <li>friendship-_to_&lt;id&gt;: the updating agent counts one unfriendly statement of agent &lt;id&gt;, i.e. the updating agent rates agent &lt;id&gt; now a little more as an enemy</li> <li>new_K: normalized surprise the updating agent experienced in the last communication (used to calculate kappa)</li> <li>kappa: median of the last ten normalized surprises the updating agent experienced</li> </ul> </li> <li>final_status <ul> <li>id/name:&nbsp;number&nbsp;if&nbsp;the&nbsp;described&nbsp;agent</li> <li>x/fr_affinity/shyness:&nbsp;the&nbsp;agent&#39;s intrinsic personality traits</li> <li>I:&nbsp;the&nbsp;agent&#39;s&nbsp;knowledge&nbsp;about&nbsp;all&nbsp;others</li> <li>Nc/Nt/Nl: total number of conversations/honest statements/dishonest statements the agent has made</li> <li>relationsm/relationsc: number of messages (conversations) the agent heard about (had with) all others</li> <li>K:&nbsp;the&nbsp;last&nbsp;10&nbsp;normalized&nbsp;surprises&nbsp;the&nbsp;agent&nbsp;experienced</li> <li>kappa:&nbsp;the&nbsp;median&nbsp;of&nbsp;K</li> <li>friendships: the agent&#39;s friendship status with all others, given as parameters of a beta function</li> <li>Jothers/Iothers/Cothers: same as above, now as full array, i.e. the combined&nbsp;information about all others</li> <li>openess/mind/decepting/strategic/egocentric/deceptive/flattering/aggressive/shameless/disturbing: the agent&#39;s character traits</li> </ul> </li> </ul>

opencc-by-4.0Nov 2022View details →
zenodo36/100

Figure 8. Bivariate plots for reputed T in A taxonomic revision of the Tragulus mouse-deer (Artiodactyla)

Figure 8. Bivariate plots for reputed T. napu specimens from the small Sundaland islands.

opencc-by-4.0Jan 2004View details →
zenodo36/100

Dataset Questionnaire Driving Repeat Purchases and E-WOM: How Price, Reputation, Hedonic Appeal, and Social Interaction Shape Consumer Behavior in Indonesia's E-Commerce Smartphone Market

<p>The following dataset is a dataset from a study that investigated price advantage, reputation, hedonic effort, and social interaction influence customer satisfaction, which in turn impacts repurchase intention and e-WOM (electronic word-of-mouth).</p>

opencc-by-4.0Nov 2024View details →
zenodo36/100

Is reputation on Stack Overflow always a good indicator for users' expertise? No!

<p>Dataset for RQ1 and RQ2.&nbsp;</p>

opencc-by-4.0Aug 2021View details →
zenodo36/100

Figure 8. Bivariate plots for reputed T in A taxonomic revision of the Tragulus mouse-deer (Artiodactyla)

Figure 8. Bivariate plots for reputed T. napu specimens from the small Sundaland islands.

opencc-by-4.0Jan 2004View details →
zenodo32/100

Replication package for: Shirking with Good Reputation? Evidence from Hotel Industry (Version 2)

<p>This replication package contains the data and the code to generate the paper&rsquo;s main results, as well as the Online Appendix, for &ldquo;Shirking with Good Reputation? Evidence from Hotel Industry&rdquo; by Fang-Chang Kuo.</p>

opencc-by-4.0May 2024View details →
zenodo32/100

HCPN Model for the article A Self-Sovereign Identity-based Authentication and Reputation Protocol for IoV Applications

<p>HCPN modules of the entire formal validation model of the article A Self-Sovereign Identity-based Authentication and Reputation Protocol for IoV Applications.</p>

opencc-by-4.0Aug 2024View details →
dryad32/100

Data from: Large-scale cooperation driven by reputation, not fear of divine punishment

Open the record for dataset details and reuse information.

publicAug 2019View details →
dryad28/100

Data from: Heterozygosity-fitness correlations in zebra finches: microsatellite markers can be better than their reputation

Numerous studies have reported associations between heterozygosity in microsatellite markers and fitness-related traits (heterozygosity-fitness correlations, HFCs). However, it has often been questioned whether HFCs reflect general inbreeding depression, because a small panel of microsatellite markers does not reflect very well an individual's inbreeding coefficient (F) as calculated from a pedigree. Here we challenge this prevailing view. Due to chance events during Mendelian segregation, an individual's realized proportion of the genome that is identical by descent (IBD) may substantially deviate from the pedigree-based expectation (i.e. F). This Mendelian noise may result in a weak correlation between F and multi-locus heterozygosity, but this does not imply that multi-locus heterozygosity is a bad estimator of realized IBD. We examined correlations between 11 fitness-related traits measured in up to 1,192 captive zebra finches and three measures of inbreeding: (1) heterozygosity across 11 microsatellite markers, (2) heterozygosity across 1,359 SNP markers, and (3) F, based on a 5-generation pedigree. All 11 phenotypic traits showed positive relationships with measures of heterozygosity, especially traits that are most closely related to fitness. Remarkably, the small panel of microsatellite markers produced equally strong HFCs as the large panel of SNP markers, and both marker-based approaches produced stronger correlations with phenotypes than the pedigree-based F. We argue that a small panel of microsatellites with high allelic richness may better reflect an individual's realized IBD than previously appreciated, especially in species like the zebra finch, where much of the genome is inherited in large blocks that rarely experience cross-over during meiosis.

opencc-zeroDec 2011View details →
dryad28/100

Data from: The influence of social preferences and reputational concerns on intergroup prosocial behavior in gains and losses contexts

To what extent do people help ingroup members based on a social preference to improve ingroup members' outcomes, versus strategic concerns about preserving their reputation within their group? And do these motives manifest differently when a prosocial behaviour occurs in the context of helping another gain a positive outcome (study 1), versus helping another to avoid losing a positive outcome (study 2)? In both contexts, we find that participants are more prosocial towards ingroup (versus outgroup members) and more prosocial when decisions are public (versus private) but find no interaction between group membership and either anonymity of the decision or expected economic value of helping. Therefore, consistent with a preference-based account of ingroup favouritism, people appear to prefer to help ingroup members more than outgroup members, regardless of whether helping can improve their reputation within their group. Moreover, this preference to help ingroup members appears to take the form of an intuitive social heuristic to help ingroup members, regardless of the economic incentives or possibility of reputation management. Theoretical and practical implications for the study of intergroup prosocial behaviour are discussed.

opencc-zeroDec 2014View details →
dryad28/100

Data from: Heterozygosity-fitness correlations in zebra finches: microsatellite markers can be better than their reputation

Open the record for dataset details and reuse information.

publicMar 2012View details →
dryad28/100

Data from: The influence of social preferences and reputational concerns on intergroup prosocial behavior in gains and losses contexts

Open the record for dataset details and reuse information.

publicDec 2015View details →
dryad28/100

Data from: The emergence and selection of reputation systems that drive cooperative behaviour

Open the record for dataset details and reuse information.

publicAug 2018View details →
zenodo24/100

How to discipline financial markets: reputation is not enough

<p>This package contains the data, programs and instructions to replicate manuscript "How to discipline financial markets: reputation is not enough" by Maria Bigoni, Gabriele Camera and Marco Casari forthcoming at JEEA.</p>

opencc-by-4.0Nov 2024View details →
dryad24/100

Data from: Human cooperation based on punishment reputation

Open the record for dataset details and reuse information.

publicFeb 2013View details →

ScienceDex guides

Understand access before you commit

These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research datasets.

Compare curated datasets

Allen Brain Atlas

Allen Brain Atlas is an Allen Institute collection of brain map atlases, datasets, APIs, and analysis tools covering mouse, human, and non-human primate brain resources.

allen-brain-atlas
neuroscienceopenDocumentation, web resources, and API references are available online.
Last verified 2026-04-30Open record

Annotated Behaviour and Observability Dataset (ABODe)

ABODe is a University of Edinburgh DataShare dataset for behavior classification in group-housed mice using home-cage video, identities, bounding boxes, ground-plate positions, and annotator labels.

abode-home-cage
behavioral-neuroscienceopenThe DataShare record exposes download links for annotations, documentation, license text, and the zipped per-snippet data directory.
Last verified 2026-04-30Open record

DANDI Archive for NWB datasets

DANDI is a BRAIN Initiative archive for publishing and sharing neurophysiology data, including electrophysiology, optophysiology, and behavioral data packaged as NWB and related standards.

dandi-nwb
electrophysiologyopenPublished Dandiset metadata and archive endpoints are available through the production DANDI API.
Last verified 2026-04-30Open record

International Brain Laboratory public data

The International Brain Laboratory public data releases expose standardized mouse decision-making experiments, including Neuropixels recordings, widefield calcium imaging, behavior, and session metadata accessed through the ONE API.

ibl
behavioral-neuroscienceopenPublic sessions can be searched and loaded from the IBL public data server through ONE.
Last verified 2026-04-29Open record

OpenNeuro

OpenNeuro is a free, open platform for sharing neuroimaging datasets, with public search, dataset pages, and download paths for web, S3, DataLad, and the OpenNeuro CLI.

openneuro
neuroscienceopenPublished datasets are available on demand over the internet.
Last verified 2026-04-29Open record