algorithms

Society relies on many algorithms for its functioning, e.g. holding regular elections, distributing vaccines etc. We often assume these algorithms to have certain logical properties. For instance, in an election, we not only want confidentiality but also verifiability (that every vote cast has been counted), and more such properties. Can we even prove that these requirements are consistent?

We present some examples of such analysis: insights from mathematical logic, computer science, game theory and dynamical systems theory seem relevant for such exploration.