person(given = "Santtu",
family = "Tikka",
role = c("aut", "cre"),
email = "santtuth@gmail.com",
comment = c(ORCID = "0000-0003-4039-4342"))

Functions for identification and transportation of causal effects.
Provides a conditional causal effect identification algorithm (IDC) by
Shpitser, I. and Pearl, J. (2006)
<http://ftp.cs.ucla.edu/pub/stat_ser/r329-uai.pdf>, an algorithm for
transportability from multiple domains with limited experiments by
Bareinboim, E. and Pearl, J. (2014)
<http://ftp.cs.ucla.edu/pub/stat_ser/r443.pdf> and a selection bias recovery
algorithm by Bareinboim, E. and Tian, J. (2015)
<http://ftp.cs.ucla.edu/pub/stat_ser/r445.pdf>. All of the previously mentioned
algorithms are based on a causal effect identification algorithm by
Tian , J. (2002) <http://ftp.cs.ucla.edu/pub/stat_ser/r309.pdf>.

Functions for identification and transportation of causal effects. Provides a conditional causal effect identification algorithm (IDC) by Shpitser, I. and Pearl, J. (2006) <http://ftp.cs.ucla.edu/pub/stat_ser/r329-uai.pdf>, an algorithm for transportability from multiple domains with limited experiments by Bareinboim, E. and Pearl, J. (2014) <http://ftp.cs.ucla.edu/pub/stat_ser/r443.pdf>, and a selection bias recovery algorithm by Bareinboim, E. and Tian, J. (2015) <http://ftp.cs.ucla.edu/pub/stat_ser/r445.pdf>. All of the previously mentioned algorithms are based on a causal effect identification algorithm by Tian , J. (2002) <http://ftp.cs.ucla.edu/pub/stat_ser/r309.pdf>.

An Interface to Specify Causal Graphs and Compute Bounds on
Causal Effects
c(
person("Michael C", "Sachs", role = c("aut", "cre"), email = "sachsmc@gmail.com"),
person("Erin E", "Gabriel", role = "aut"),
person("Arvid", "Sjölander", role = "aut"),
person("Alexander A", "Balke", role = "ctb",comment ="(C++ code)"),
person("Colorado", "Reed", role = "ctb", comment = "(graph-creator.js)")
)
When causal quantities are not identifiable from the observed data, it still may be possible
to bound these quantities using the observed data. We outline a class of problems for which the
derivation of tight bounds is always a linear programming problem and can therefore, at least
theoretically, be solved using a symbolic linear optimizer. We extend and generalize the
approach of Balke and Pearl (1994) <doi:10.1016/B978-1-55860-332-5.50011-0> and we provide
a user friendly graphical interface for setting up such problems via directed acyclic
graphs (DAG), which only allow for problems within this class to be depicted. The user can
then define linear constraints to further refine their assumptions to meet their specific
problem, and then specify a causal query using a text interface. The program converts this
user defined DAG, query, and constraints, and returns tight bounds. The bounds can be
converted to R functions to evaluate them for specific datasets, and to latex code for
publication. The methods and proofs of tightness and validity of the bounds are described in
a preprint by Sachs, Gabriel, and Sjölander (2020)
<https://sachsmc.github.io/causaloptim/articles/CausalBoundsMethods.pdf>.
Michael C Sachs [aut, cre],
Erin E Gabriel [aut],
Arvid Sjölander [aut],
Alexander A Balke [ctb] ((C++ code)),
Colorado Reed [ctb] ((graph-creator.js))