The problem of fairly allocating a set of indivisible items is a well-kn...
Maintaining real-time communication quality in metaverse has always been...
Cake-cutting is a fundamental model of dividing a heterogeneous resource...
We study a fair division setting in which a number of players are to be
...
In the classical version of online bipartite matching, there is a given ...
In multiwinner approval voting, the goal is to select k-member committee...
Justified representation (JR) is a standard notion of representation in
...
We study the problem of dividing a multi-layered cake among heterogeneou...
The notion of envy-freeness is a natural and intuitive fairness
requirem...
A tangle is a connected topological space constructed by gluing several
...
With the advent of the ride-sharing platform, the carpooling has become
...
Consensus halving refers to the problem of dividing a resource into two ...
We initiate the study of multi-layered cake cutting with the goal of fai...
In this paper, we present new results on the fair and efficient allocati...
We study the fair allocation of indivisible goods under the assumption t...
We study how stability can be maintained even after any set of at most k...
We consider a coalition formation setting where each agent belongs to on...
We consider strategic games that are inspired by Schelling's model of
re...
We study the problem of allocating indivisible items to agents with addi...
A community needs to be partitioned into disjoint groups; each community...
We study the existence of allocations of indivisible goods that are envy...
We consider the problem of fairly dividing a set of items. Much of the f...
In a directed graph, a kernel is a subset of vertices that is both stabl...
We propose a new variant of the group activity selection problem (GASP),...
Cooperative games provide a framework to study cooperation among
self-in...
We develop a model of multiwinner elections that combines performance-ba...