Hannaneh Akrami

Orcid: 0000-0002-9935-5869

According to our database1, Hannaneh Akrami authored at least 12 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Breaking the 3/4 Barrier for Approximate Maximin Share.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Improving Approximation Guarantees for Maximin Share.
CoRR, 2023

EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Simplification and Improvement of MMS Approximation.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Fair and Efficient Allocation of Indivisible Chores with Surplus.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
Maximizing Nash Social Welfare in 2-Value Instances: The Half-Integer Case.
CoRR, 2022

EFX Allocations: Simplifications and Improvements.
CoRR, 2022

An EF2X Allocation Protocol for Restricted Additive Valuations.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Maximizing Nash Social Welfare in 2-Value Instances.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Nash Social Welfare for 2-value Instances.
CoRR, 2021

2019
Ratio-balanced maximum flows.
Inf. Process. Lett., 2019


  Loading...