Eisenberg-Gale markets: algorithms and game-theoretic properties (Q993788)
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: Eisenberg-Gale markets: algorithms and game-theoretic properties |
scientific article; zbMATH DE number 5788963
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Eisenberg-Gale markets: algorithms and game-theoretic properties |
scientific article; zbMATH DE number 5788963 |
Statements
Eisenberg-Gale markets: algorithms and game-theoretic properties (English)
0 references
20 September 2010
0 references
In the context of Eisenberg-Gale markets, the authors prove a strongly polynomial algorithm for computing equilibrium flows and prices of edges for a flow market in any network, directed or undirected, with one source and multiple sinks.
0 references
general equilibrium theory
0 references
Fisher market model
0 references
combinatorial algorithm
0 references
primal-dual algorithm
0 references
convex program
0 references
resource allocation
0 references
ascending price auctions
0 references
weak Gross substitutability
0 references
competition monotonicity
0 references
fairness
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8646491
0 references
0 references
0.8624897
0 references
0.8621219
0 references
