Related papers: Probabilistic Aspects of Voting, Intransitivity an…
We present a tool-based approach for the runtime analysis of communicating processes grounded on probabilistic binary session types. We synthesise a monitor out of a probabilistic session type where each choice point is decorated by a…
This is an updated version of the lectures notes for a course on condensed mathematics taught in the summer term 2019 at the University of Bonn. The material presented is joint work with Dustin Clausen. This is intended as a stable citable…
In the context of computational social choice, we study voting methods that assign a set of winners to each profile of voter preferences. A voting method satisfies the property of positive involvement (PI) if for any election in which a…
This volume contains the proceedings of the Twelfth Workshop on Quantitative Aspects of Programming Languages and Systems (QAPL 2014), held in Grenoble, France, on 12 and 13 April, 2014. QAPL 2014 was a satellite event of the European Joint…
The present overview and gentle introduction to Grassmannian calculus and some of its applications to probability collects the notes of a mini-course given by the authors at the Brazilian School of Probability, August 5-9, 2024, in…
These notes constitute the basis for the lectures given by the author at Centre de recherches math\'ematiques (CRM) at Universit\'e de Montreal, as part of the thematic semester on "Mathematical challenges in many-body physics and quantum…
These lecture notes are an informal introduction to the theory of computational complexity and its links to quantum computing and statistical mechanics.
These lecture notes give a statistical perspective on the foundations of reinforcement learning and interactive decision making. We present a unifying framework for addressing the exploration-exploitation dilemma using frequentist and…
These are lecture notes on Floer and Rabinowitz-Floer homology written for a graduate course at UNICAMP August-December 2016 and a mini-course held at IMPA in August 2017.
Election results are determined by numerous social factors that affect the formation of opinion of the voters, including the network of interactions between them and the dynamics of opinion influence. In this work we study the result of…
Methods of high-dimensional probability play a central role in applications for statistics, signal processing theoretical computer science and related fields. These lectures present a sample of particularly useful tools of high-dimensional…
We propose a general framework for strategic voting when a voter may lack knowledge about other votes or about other voters' knowledge about her own vote. In this setting we define notions of manipulation and equilibrium. We also model…
Recommender systems are highly prevalent in the modern world due to their value to both users and platforms and services that employ them. Generally, they can improve the user experience and help to increase satisfaction, but they do not…
These are notes to accompany four lectures that I gave at the School on Additive Combinatorics, held in Montreal, Quebec between March 30th and April 5th 2006. My aim is to introduce ``quadratic fourier analysis'' in so far as we understand…
We present the summary of the general discussion on the probabilistic foundations of quantum theory that took place during the round table at the Int. Conf. "Foundations of Probability and Physics", V\"axj\"o, Sweden-2000. It is possible to…
These notes are based on a series of lectures given by the author at the Centre Bernoulli (EPFL) in July 2016. They aim at illustrating the importance of the mod-$\ell$ cohomology of Deligne--Lusztig varieties in the modular representation…
This is a series of three lectures I gave at the Korea Institute of Advanced Study in June 2019 at a workshop about "Algebraic and Symplectic Aspects of Degenerations of Complex Surfaces". I focus on the symplectic aspects, in particular on…
A variant of Phragm\'en's method for proportional representation via approval voting is briefly explored. Instead of D'Hondt's rule, this variant generalizes Sainte-Lagu\"e's rule.
Algorithmic information theory roots the concept of information in computation rather than probability. These lecture notes were constructed in conjunction with the graduate course I taught at Universit\`a della Svizzera italiana in the…
These lecture notes introduce key concepts of mathematical population genetics within the most elementary setting and describe a few recent applications to microbial evolution experiments. Pointers to the literature for further reading are…