The classic house allocation problem is primarily concerned with finding a matching
between a set of agents and a set of houses that guarantees some notion of economic …

We consider the setting where the members of a society (voters) have preferences over
candidates, and the candidates can be ordered on an axis so that the voters' preferences …

Headway, namely the distance between vehicles, is a key design factor for ensuring the safe
operation of autonomous driving systems. There have been studies on headway …

We analyze how numerical experiments regarding elections were conducted within the
computational social choice literature (focusing on papers published in the IJCAI, AAAI, and …

In this paper, we study the problem of eliciting preferences of agents in the house allocation
model. For this we build on a recently introduced model and focus on the task of eliciting …

In the assignment problem, the goal is to assign indivisible items to agents who have ordinal
preferences, efficiently and fairly, in a strategyproof manner. In practice, first-choice …

In this work, we study truthful mechanisms for the rank-maximal matching problem, in the
view of approximation. Our result reduces the gap from both the upper and lower bound …

In the roommate problem, pairs of agents must be formed, based on ordinal preferences of
the agents over each other. In this article, we examine fair roommate matchings by relaxing …

In terms of autonomous-cars, car parking problem is one of the problems that has to be
addressed. The allocation of autonomous car parking spaces is a complex problem that …

With the advent of automated or semi-automated decision systems in artificial intelligence
comes the need of making them more reliable and transparent for an end-user. While the …