<progress id="hpfzt"><pre id="hpfzt"></pre></progress>
<ruby id="hpfzt"></ruby>
<big id="hpfzt"><p id="hpfzt"></p></big>

<progress id="hpfzt"></progress>

<big id="hpfzt"><pre id="hpfzt"></pre></big>

<i id="hpfzt"></i>

<strike id="hpfzt"><video id="hpfzt"><ins id="hpfzt"></ins></video></strike>
<dl id="hpfzt"></dl>
Mirror operated in collaboration with local support

### Current browse context:

econ.TH

### Bookmark

(what is this?)

# Title: Cooperation in Small Groups -- an Optimal Transport Approach

Authors: Xinyang Wang
Abstract: 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.
 Comments: 56 pages, 3 figures Subjects: Theoretical Economics (econ.TH); Computer Science and Game Theory (cs.GT); Optimization and Control (math.OC) Cite as: arXiv:2005.11244 [econ.TH] (or arXiv:2005.11244v1 [econ.TH] for this version)

## Submission history

From: Xinyang Wang [view email]
[v1] Fri, 22 May 2020 15:56:08 GMT (294kb,D)
Æ´ÈýÕÅÓÎÏ·ÏÂÔØ