Bhaskar Ray Chaudhury

J. ACM, 2024

Competitive Equilibrium for Chores: from Dual Eisenberg-Gale to a Fast, Greedy, LP-based Algorithm.

[BibT_eX]

[DOI]

Christian Kroer

Tianlong Nan

CoRR, 2024

2023

A Complementary Pivot Algorithm for Competitive Allocation of a Mixed Manna.

[BibT_eX]

[DOI]

Math. Oper. Res., August, 2023

EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number.

[BibT_eX]

[DOI]

Noga Alon

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Incentives in Federated Learning: Equilibria, Dynamics, and Mechanisms for Welfare Maximization.

[BibT_eX]

[DOI]

Aniket Murhekar

Zhuowen Yuan

Bo Li

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Fair and Efficient Allocation of Indivisible Chores with Surplus.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022

Fair Division of Indivisible Goods for a Class of Concave Valuations.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2022

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

[BibT_eX]

[DOI]

CoRR, 2022

EFX Allocations: Simplifications and Improvements.

[BibT_eX]

[DOI]

CoRR, 2022

Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores.

[BibT_eX]

[DOI]

Shant Boodaghians

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

Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness.

[BibT_eX]

[DOI]

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

Fairness in Federated Learning via Core-Stability.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

On the Existence of EFX Allocations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

On the Existence of Competitive Equilibrium with Chores.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Maximizing Nash Social Welfare in 2-Value Instances.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Finding fair and efficient allocations.

[BibT_eX]

[DOI]

PhD thesis, 2021

A Little Charity Guarantees Almost Envy-Freeness.

[BibT_eX]

[DOI]

Telikepalli Kavitha

Alkmini Sgouritsa

SIAM J. Comput., 2021

Nash Social Welfare for 2-value Instances.

[BibT_eX]

[DOI]

Golnoosh Shahkarami

Quentin Vermande

CoRR, 2021

Competitive Allocation of a Mixed Manna.

[BibT_eX]

[DOI]

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

Improving EFX Guarantees through Rainbow Cycle Number.

[BibT_eX]

[DOI]

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Fair and Efficient Allocations under Subadditive Valuations.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Polyline simplification has cubic complexity.

[BibT_eX]

[DOI]

Karl Bringmann

J. Comput. Geom., 2020

Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores.

[BibT_eX]

[DOI]

CoRR, 2020

2018

Combinatorial Algorithms for General Linear Arrow-Debreu Markets.

[BibT_eX]

[DOI]

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

On Fair Division for Indivisible Items.

[BibT_eX]

[DOI]

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS.

[BibT_eX]

[DOI]

Karl Bringmann