Envy-free matchings in bipartite graphs and their applications to fair division (Q6154777)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Envy-free matchings in bipartite graphs and their applications to fair division |
scientific article; zbMATH DE number 7805727
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Envy-free matchings in bipartite graphs and their applications to fair division |
scientific article; zbMATH DE number 7805727 |
Statements
Envy-free matchings in bipartite graphs and their applications to fair division (English)
0 references
16 February 2024
0 references
fair division
0 references
cake cutting
0 references
maximin share
0 references
bipartite graphs
0 references
perfect matching
0 references
maximum matching
0 references
0 references
