Tomer Ezra
Orcid: 0000000306264851
According to our database^{1},
Tomer Ezra
authored at least 34 papers
between 2017 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2024
CoRR, 2024
CoRR, 2024
CoRR, 2024
CoRR, 2024
CoRR, 2024
CoRR, 2024
Proceedings of the Algorithmic Game Theory  17th International Symposium, 2024
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024
Proceedings of the Approximation, 2024
Proceedings of the ThirtyEighth AAAI Conference on Artificial Intelligence, 2024
2023
Proceedings of the Web and Internet Economics  19th International Conference, 2023
Proceedings of the Web and Internet Economics  19th International Conference, 2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
"Who is Next in Line?" On the Significance of Knowing the Arrival Order in Bayesian Online Settings.
Proceedings of the 2023 ACMSIAM Symposium on Discrete Algorithms, 2023
Proceedings of the 24th ACM Conference on Economics and Computation, 2023
2022
Math. Oper. Res., 2022
CoRR, 2022
Proceedings of the Web and Internet Economics  18th International Conference, 2022
General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022
2021
PhD thesis, 2021
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021
Proceedings of the Algorithmic Game Theory  14th International Symposium, 2021
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
Proceedings of the ThirtyFifth AAAI Conference on Artificial Intelligence, 2021
2020
ACM Trans. Economics and Comput., 2020
SIGecom Exch., 2020
CoRR, 2020
Online Stochastic MaxWeight Matching: Prophet Inequality for Vertex and Edge Arrival Models.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020
2019
Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
2018
ComplementFree Couples Must Communicate: A Hardness Result for TwoPlayer Combinatorial Auctions.
CoRR, 2018
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018
2017
CoRR, 2017
Proceedings of the 12th workshop on the Economics of Networks, Systems and Computation, 2017