Aleck C. Johnsen

Anant Shah

CoRR, 2024

Equivocal Blends: Prior Independent Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

Extension of Minimax for Algorithmic Lower Bounds.

[BibT_eX]

[DOI]

CoRR, 2023

Screening with Disadvantaged Agents.

[BibT_eX]

[DOI]

Proceedings of the 4th Symposium on Foundations of Responsible Computing, 2023

2022

Bias-Variance Games.

[BibT_eX]

[DOI]

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

2021

Lower Bounds for Prior Independent Algorithms.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Inference from Auction Prices.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Benchmark Design and Prior-independent Optimization.

[BibT_eX]

[DOI]

Yingkai Li

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Mechanisms for a No-Regret Agent: Beyond the Common Prior.

[BibT_eX]

[DOI]

Modibo K. Camara

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Dashboard Mechanisms for Online Marketplaces.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2017

A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

2014

A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tile set synthesis.

[BibT_eX]

[DOI]

CoRR, 2014

Computing Minimum Tile Sets to Self-Assemble Colors Patterns.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Computing Minimum Tile Sets to Self-Assemble Color Patterns.

[BibT_eX]

[DOI]