Related papers: Optimal Group Size in Microlending
Decision-making individuals are typically either an imitator, who mimics the action of the most successful individual(s), a conformist (or coordinating individual), who chooses an action if enough others have done so, or a nonconformist (or…
The ``social brain hypothesis'' for the evolution of large brains in primates has led to evidence for the coevolution of neocortical size and social group sizes. Extrapolation of these findings to modern humans indicated that the equivalent…
In the framework of evolutionary games with institutional reciprocity, limited incentives are at disposal for rewarding cooperators and punishing defectors. In the simplest case, it can be assumed that, depending on their strategies, all…
With the integration of renewable sources in electricity distribution networks, the need to develop intelligent mechanisms for balancing the energy market has arisen. In the absence of such mechanisms, the energy market may face imbalances…
The effectiveness of machine learning in evaluating the creditworthiness of loan applicants has been demonstrated for a long time. However, there is concern that the use of automated decision-making processes may result in unequal treatment…
We determine the optimal investment strategy of an individual who targets a given rate of consumption and who seeks to minimize the probability of going bankrupt before she dies, also known as {\it lifetime ruin}. We impose two types of…
We study group fairness in the context of feedback loops induced by meritocratic selection into programs that themselves confer additional advantage, like college admissions. We introduce a stylized, yet novel inter-generational model for…
Given a graph $G$, a community structure $\mathcal{C}$, and a budget $k$, the fair influence maximization problem aims to select a seed set $S$ ($|S|\leq k$) that maximizes the influence spread while narrowing the influence gap between…
In crowd labeling, a large amount of unlabeled data instances are outsourced to a crowd of workers. Workers will be paid for each label they provide, but the labeling requester usually has only a limited amount of the budget. Since data…
Behavioral experiments on the Ultimatum Game have shown that we human beings have remarkable preference in fair play, contradicting the predictions by the game theory. Most of the existing models seeking for explanations, however, strictly…
Group testing is the process of pooling arbitrary subsets from a set of $n$ items so as to identify, with a minimal number of tests, a "small" subset of $d$ defective items. In "classical" non-adaptive group testing, it is known that when…
Closeness is a widely-used centrality measure in social network analysis. For a node it indicates the reciprocal of the average shortest-path distance to the other nodes of the network. While the identification of the k nodes with highest…
We introduce the problem of robust subgroup discovery, i.e., finding a set of interpretable descriptions of subsets that 1) stand out with respect to one or more target attributes, 2) are statistically robust, and 3) non-redundant. Many…
We study the problem of fairly allocating a set of indivisible items among a set of agents. We consider the notion of (approximate) maximin share (MMS) and we provide an improved lower bound of $1/2$ (which is tight) for the case of…
In the classical combinatorial (adaptive) group testing problem, one is given two integers \(d\) and \(n\), where \(0\le d\le n\), and a population of \(n\) items, exactly \(d\) of which are known to be defective. The question is to devise…
We show that in any $n$-player $m$-action normal-form game, we can obtain an approximate equilibrium by sampling any mixed-action equilibrium a small number of times. We study three types of equilibria: Nash, correlated and coarse…
A popular technique for tolerating malicious faults in open distributed systems is to establish small groups of participants, each of which has a non-faulty majority. These groups are used as building blocks to design attack-resistant…
To divide a "manna" {\Omega} of private items (commodities, workloads, land, time intervals) between n agents, the worst case measure of fairness is the welfare guaranteed to each agent, irrespective of others' preferences. If the manna is…
An essential task of groups is to provide efficient solutions for the complex problems they face. Indeed, considerable efforts have been devoted to the question of collective decision-making related to problems involving a single dominant…
We consider the problem of identifying a subset of nodes in a network that will enable the fastest spread of information in a decentralized environment.In a model of communication based on a random walk on an undirected graph, the optimal…