Polynomial time algorithms to find an approximate competitive equilibrium for chores (Q6575166)
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: Polynomial time algorithms to find an approximate competitive equilibrium for chores |
scientific article; zbMATH DE number 7883673
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial time algorithms to find an approximate competitive equilibrium for chores |
scientific article; zbMATH DE number 7883673 |
Statements
Polynomial time algorithms to find an approximate competitive equilibrium for chores (English)
0 references
19 July 2024
0 references
