We study the problem of fair sequential decision making given voter preferences. In each
round, a decision rule must choose a decision from a set of alternatives where each voter …

We study a model of temporal voting where there is a fixed time horizon, and at each round
the voters report their preferences over the available candidates and a single candidate is …

For the problem of aggregating several rankings into one ranking, Kemeny (1959) proposed
two methods: the median rule which selects the ranking with the smallest total swap distance …

In Approval-Based Committee (ABC) voting, each voter lists the candidates they approve
and then a voting rule aggregates the individual approvals into a committee that represents …

We study situations where a group of voters need to take a collective decision over a
number of public issues, with the goal of getting a result that reflects the voters' opinions in a …

Perpetual voting studies fair collective decision-making in settings where many decisions
are to be made, and is a natural framework for settings such as parliaments and the running …

The edge coloring problems for graphs is to assign colors to the edges of a given graph so
that any two edges meeting at a vertex are assigned different colors. Trivially, the number of …

©2024 Rashmika Goswami ALL RIGHTS RESERVED Page 1 ©2024 Rashmika Goswami ALL
RIGHTS RESERVED Page 2 Page 3 TWO RANDOM PROCESSES FOR APPROXIMATING …

In a participatory budgeting problem, we denote the budget limit (ie the taxes collected) by
𝑏. There is a list of 𝑚 projects (forming a set 𝐶), where each 𝑗∈ 𝐶 is associated with a cost …

I consider a setting where a group of individuals make a number of independent binary
decisions (YES or NO) with respect to a number of issues. For each individual, every issue …