Table 1 Matching parameters and model parameters used in this paper.
From: A game theoretic approach to balance privacy risks and familial benefits
Type | Notations | Definition | Value |
|---|---|---|---|
Matching parameters | \(N_0\) | Number of couples from current generation | 90,000,000 |
r | Average number of children per couple | 2.5 | |
L | Genome length (in Morgans) | 35 | |
m | Minimum length of identity-by-descent (IBD) segments in order to be detected | 0.06 | |
\(n_s\) | Number of IBD segments required to declare a match | 2 | |
\(n_u\) | Minimum number of detected matches required to declare success of identification | 2 | |
\(g_{maxi}\) | Relationships that can help to identify a target | 5 | |
\(g_{maxc}\) | Relationships to consider when finding relatives of a target | 3 | |
Model parameters | P | The set of players | Â |
\(s_i\) | Player i’s strategy |  | |
\(s_{-i}\) | Strategies of all players except i | Â | |
\(b_i\) | Player i’s valuation for finding a relative in the database |  | |
\(v_i\) | Player i’s net valuation for other services provided by TPI services |  | |
\(c_i\) | Player i’s valuation for the risk of being identified |  | |
K | Number of players who use the TPI services | Â | |
\(K_{-i}\) | Number of players other than i use TPI services | Â | |
T | A collection of types of players | Â | |
t | A player type, \(t \in T\) | Â | |
\(n_t\) | Number of types in our simulation | Â |
