Published August 24, 2025
| Version v1
Working paper
Open
An Algorithm for Distributing a Resource among the Vertices of a Dynamic DAG
Creators
Description
We present an algorithm for distributing a fixed quantity of resources among the vertices of a directed acyclic graph (DAG), where vertices can be toggled on or off, and new vertices and edges may be added over time. Central to the algorithm is a generalization of the genetic coefficient of relationship to arbitrary DAGs.
Files
An_Algorithm_for_Distributing_a_Resource_among_the_Vertices_of_a_Dynamic_Directed_Acyclic_Graph.pdf
Files
(224.7 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:d6a8be5a928d3fe94e2ed3cf84e94a66
|
224.7 kB | Preview Download |
Additional details
References
- Sewall Wright, Coefficients of inbreeding and relationship, The American Naturalist 56 (1922), no. 645, 330–338.