Cooperation in Small Groups – an Optimal Transport Approach

05/22/2020
by   Xinyang Wang, et al.
0

If agents cooperate only within small groups of some bounded sizes, is there a way to partition the population into small groups such that no collection of agents can do better by forming a new group? This paper revisited f-core in a transferable utility setting. By providing a new formulation to the problem, we built up a link between f-core and the transportation theory. Such a link helps us to establish an exact existence result, and a characterization result of f-core for a general class of agents, as well as some improvements in computing the f-core in the finite type case.

READ FULL TEXT
research
01/24/2019

Almost Envy-Freeness in Group Resource Allocation

We study the problem of fairly allocating indivisible goods between grou...
research
07/01/2021

On the functional graph of the power map over finite groups

In this paper we study the description of the digraph associated with th...
research
09/08/2017

On Democratic Fairness for Groups of Agents

We study the problem of allocating indivisible goods to groups of intere...
research
01/22/2023

Cutting a Cake Fairly for Groups Revisited

Cake cutting is a classic fair division problem, with the cake serving a...
research
05/24/2022

On Hedonic Games with Common Ranking Property

Hedonic games are a prominent model of coalition formation, in which eac...
research
11/04/2018

Syntax and Typing for Cedille Core

This document specifies a core version of the type theory implemented in...
research
03/31/2022

Approximate Group Fairness for Clustering

We incorporate group fairness into the algorithmic centroid clustering p...

Please sign up or login with your details

Forgot password? Click here to reset