Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders (Q4997307): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
EloiFerrer (talk | contribs) Merged Item from Q5361892 |
||||||||||||||
| aliases / en / 0 | aliases / en / 0 | ||||||||||||||
Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders | |||||||||||||||
| description / en | description / en | ||||||||||||||
scientific article; zbMATH DE number 6784131 | |||||||||||||||
| Property / title | |||||||||||||||
Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders (English) | |||||||||||||||
| Property / title: Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Open document ID | |||||||||||||||
| Property / zbMATH Open document ID: 1377.91105 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / DOI | |||||||||||||||
| Property / DOI: 10.1145/2897518.2897569 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / published in | |||||||||||||||
| Property / published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / publication date | |||||||||||||||
29 September 2017
| |||||||||||||||
| Property / publication date: 29 September 2017 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / Mathematics Subject Classification ID | |||||||||||||||
| Property / Mathematics Subject Classification ID: 68W25 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH DE Number | |||||||||||||||
| Property / zbMATH DE Number: 6784131 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Keywords | |||||||||||||||
auctions | |||||||||||||||
| Property / zbMATH Keywords: auctions / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Keywords | |||||||||||||||
submodular valuations | |||||||||||||||
| Property / zbMATH Keywords: submodular valuations / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / OpenAlex ID | |||||||||||||||
| Property / OpenAlex ID: W2275395982 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Latest revision as of 10:21, 6 May 2024
scientific article; zbMATH DE number 6784131
- Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders |
scientific article; zbMATH DE number 6784131 |
|
Statements
Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders (English)
0 references
Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders (English)
0 references
29 June 2021
0 references
29 September 2017
0 references
combinatorial auctions
0 references
truthful mechanisms
0 references
approximation algorithms
0 references
auctions
0 references
submodular valuations
0 references
