Time bounds for iterative auctions: a unified approach by discrete convex analysis (Q1751147)
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: Time bounds for iterative auctions: a unified approach by discrete convex analysis |
scientific article; zbMATH DE number 6872075
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Time bounds for iterative auctions: a unified approach by discrete convex analysis |
scientific article; zbMATH DE number 6872075 |
Statements
Time bounds for iterative auctions: a unified approach by discrete convex analysis (English)
0 references
24 May 2018
0 references
discrete optimization
0 references
submodular function
0 references
discrete convex function
0 references
Walrasian equilibrium
0 references
iterative auction
0 references
0 references
0 references
0.86503774
0 references
0.8599522
0 references
0.8595013
0 references
0 references
0.8578092
0 references
0 references
0.85152626
0 references
