Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions (Q5071085)
From MaRDI portal
scientific article; zbMATH DE number 7510281
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions |
scientific article; zbMATH DE number 7510281 |
Statements
Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions (English)
0 references
20 April 2022
0 references
combinatorial auctions
0 references
communication complexity
0 references
simultaneous communication
0 references
fractionally subadditive
0 references
0 references
0 references
0 references
0 references
