Endogenous Group Formation Via Unproductive Costs

Sacrifice is widely believed to enhance cooperation in churches, communes, gangs, clans, military units, and many other groups. We find that sacrifice can also work in the lab, apart from special ideologies, identities, or interactions. Our subjects play a modified VCM game—one in which they can voluntarily join groups that provide reduced rates of return on private investment. This leads to both endogenous sorting (because free-riders tend to reject the reduced-rate option) and substitution (because reduced private productivity favours increased club involvement). Seemingly unproductive costs thus serve to screen out free-riders, attract conditional cooperators, boost club production, and increase member welfare. The sacrifice mechanism is simple and particularly useful where monitoring difficulties impede punishment, exclusion, fees, and other more standard solutions

Maximizing Happiness in Graphs of Bounded Clique-Width

Clique-width is one of the most important parameters that describes structural complexity of a graph. Probably, only treewidth is more studied graph width parameter. In this paper we study how clique-width influences the complexity of the Maximum Happy Vertices (MHV) and Maximum Happy Edges (MHE) problems. We answer a question of Choudhari and Reddy '18 about parameterization by the distance to threshold graphs by showing that MHE is NP-complete on threshold graphs. Hence, it is not even in XP when parameterized by clique-width, since threshold graphs have clique-width at most two. As a complement for this result we provide a $n^{\mathcal{O}(\ell \cdot \operatorname{cw})}$ algorithm for MHE, where $\ell$ is the number of colors and $\operatorname{cw}$ is the clique-width of the input graph. We also construct an FPT algorithm for MHV with running time $\mathcal{O}^*((\ell+1)^{\mathcal{O}(\operatorname{cw})})$, where $\ell$ is the number of colors in the input. Additionally, we show $\mathcal{O}(\ell n^2)$ algorithm for MHV on interval graphs.Comment: Accepted to LATIN 202

PCR Primers for Metazoan Mitochondrial 12S Ribosomal DNA Sequences

Background: Assessment of the biodiversity of communities of small organisms is most readily done using PCR-based analysis of environmental samples consisting of mixtures of individuals. Known as metagenetics, this approach has transformed understanding of microbial communities and is beginning to be applied to metazoans as well. Unlike microbial studies, where analysis of the 16S ribosomal DNA sequence is standard, the best gene for metazoan metagenetics is less clear. In this study we designed a set of PCR primers for the mitochondrial 12S ribosomal DNA sequence based on 64 complete mitochondrial genomes and then tested their efficacy. Methodology/Principal Findings: A total of the 64 complete mitochondrial genome sequences representing all metazoan classes available in GenBank were downloaded using the NCBI Taxonomy Browser. Alignment of sequences was performed for the excised mitochondrial 12S ribosomal DNA sequences, and conserved regions were identified for all 64 mitochondrial genomes. These regions were used to design a primer pair that flanks a more variable region in the gene. Then all of the complete metazoan mitochondrial genomes available in NCBI’s Organelle Genome Resources database were used to determine the percentage of taxa that would likely be amplified using these primers. Results suggest that these primers will amplify target sequences for many metazoans. Conclusions/Significance: Newly designed 12S ribosomal DNA primers have considerable potential for metazoa

The importance of identity-by-state information for the accuracy of genomic selection

<p>Abstract</p> <p>Background</p> <p>It is commonly assumed that prediction of genome-wide breeding values in genomic selection is achieved by capitalizing on linkage disequilibrium between markers and QTL but also on genetic relationships. Here, we investigated the reliability of predicting genome-wide breeding values based on population-wide linkage disequilibrium information, based on identity-by-descent relationships within the known pedigree, and to what extent linkage disequilibrium information improves predictions based on identity-by-descent genomic relationship information.</p> <p>Methods</p> <p>The study was performed on milk, fat, and protein yield, using genotype data on 35 706 SNP and deregressed proofs of 1086 Italian Brown Swiss bulls. Genome-wide breeding values were predicted using a genomic identity-by-state relationship matrix and a genomic identity-by-descent relationship matrix (averaged over all marker loci). The identity-by-descent matrix was calculated by linkage analysis using one to five generations of pedigree data.</p> <p>Results</p> <p>We showed that genome-wide breeding values prediction based only on identity-by-descent genomic relationships within the known pedigree was as or more reliable than that based on identity-by-state, which implicitly also accounts for genomic relationships that occurred before the known pedigree. Furthermore, combining the two matrices did not improve the prediction compared to using identity-by-descent alone. Including different numbers of generations in the pedigree showed that most of the information in genome-wide breeding values prediction comes from animals with known common ancestors less than four generations back in the pedigree.</p> <p>Conclusions</p> <p>Our results show that, in pedigreed breeding populations, the accuracy of genome-wide breeding values obtained by identity-by-descent relationships was not improved by identity-by-state information. Although, in principle, genomic selection based on identity-by-state does not require pedigree data, it does use the available pedigree structure. Our findings may explain why the prediction equations derived for one breed may not predict accurate genome-wide breeding values when applied to other breeds, since family structures differ among breeds.</p

Bounding clique-width via perfect graphs

We continue the study into the clique-width of graph classes defined by two forbidden induced graphs. We present three new classes of bounded clique-width and one of unbounded clique-width. The four new graph classes have in common that one of their two forbidden induced subgraphs is the diamond. To prove boundedness of clique-width for the first three cases we develop a technique based on bounding clique covering number in combination with reduction to subclasses of perfect graphs. We extend our proof of unboundedness for the fourth case to show that Graph Isomorphism is Graph Isomorphism-complete on the same graph class

Delegation and coordination with multiple threshold public goods: experimental evidence

When multiple charities, social programs and community projects simultaneously vie for funding, donors risk mis-coordinating their contributions leading to an inefficient distribution of funding across projects. Community chests and other intermediary organizations facilitate coordination among donors and reduce such risks. To study this, we extend a threshold public goods framework to allow donors to contribute through an intermediary rather than directly to the public goods. Through a series of experiments, we show that the presence of an intermediary increases public good success and subjects’ earnings only when the intermediary is formally committed to direct donations to socially beneficial goods. Without such a restriction, the presence of an intermediary has a negative impact, complicating the donation environment, decreasing contributions and public good success.When multiple charities, social programs and community projects simultaneously vie for funding, donors risk mis-coordinating their contributions leading to an inefficient distribution of funding across projects. Community chests and other intermediary organizations facilitate coordination among donors and reduce such risks. To study this, we extend a threshold public goods framework to allow donors to contribute through an intermediary rather than directly to the public goods. Through a series of experiments, we show that the presence of an intermediary increases public good success and subjects’ earnings only when the intermediary is formally committed to direct donations to socially beneficial goods. Without such a restriction, the presence of an intermediary has a negative impact, complicating the donation environment, decreasing contributions and public good success

Clique-width : harnessing the power of atoms.

Many NP-complete graph problems are polynomial-time solvable on graph classes of bounded clique-width. Several of these problems are polynomial-time solvable on a hereditary graph class G if they are so on the atoms (graphs with no clique cut-set) of G . Hence, we initiate a systematic study into boundedness of clique-width of atoms of hereditary graph classes. A graph G is H-free if H is not an induced subgraph of G, and it is (H1,H2) -free if it is both H1 -free and H2 -free. A class of H-free graphs has bounded clique-width if and only if its atoms have this property. This is no longer true for (H1,H2) -free graphs, as evidenced by one known example. We prove the existence of another such pair (H1,H2) and classify the boundedness of clique-width on (H1,H2) -free atoms for all but 18 cases