On the Nisan-Ronen conjecture for submodular valuations
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 15773
- Type
- E - Conference contribution
- DOI
-
10.1145/3357713.3384299
- Title of conference / published proceedings
- Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2020)
- First page
- 1086
- Volume
- -
- Issue
- -
- ISSN
- 0737-8017
- Open access status
- Compliant
- Month of publication
- June
- Year of publication
- 2020
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This work makes progress on the oldest open problem in Algorithmic Mechanism Design, the Nisan-Ronen conjecture. In late 2020, the new technique developed in this paper enabled the same authors to make another big step towards proving the full conjecture (https://arxiv.org/abs/2011.14434).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -