Tomer Ezra

Orcid: 0000-0003-0626-4851

According to our database1, Tomer Ezra authored at least 34 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Multi-Agent Combinatorial Contracts.
CoRR, 2024

Sequential Contracts.
CoRR, 2024

Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms.
CoRR, 2024

Optimal Mechanisms for Consumer Surplus Maximization.
CoRR, 2024

Contracts with Inspections.
CoRR, 2024

The Competition Complexity of Prophet Inequalities.
CoRR, 2024

Fair Division with Interdependent Values.
Proceedings of the Algorithmic Game Theory - 17th International Symposium, 2024

On the (In)approximability of Combinatorial Contracts.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment.
Proceedings of the Approximation, 2024

Pandora's Problem with Deadlines.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Prophet Inequalities via the Expected Competitive Ratio.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

The Importance of Knowing the Arrival Order in Combinatorial Bayesian Settings.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Multi-agent Contracts.
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 ACM-SIAM Symposium on Discrete Algorithms, 2023

Pandora's Problem with Combinatorial Cost.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
Prophet Matching with General Arrivals.
Math. Oper. Res., 2022

On the Significance of Knowing the Arrival Order in Prophet Inequality.
CoRR, 2022

On Best-of-Both-Worlds Fair-Share Allocations.
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
Simple Mechanisms for Limited Information Settings
PhD thesis, 2021

Fair-Share Allocations for Agents with Arbitrary Entitlements.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Prophet Inequality with Competing Agents.
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

On a Competitive Secretary Problem with Deferred Selections.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Combinatorial Contracts.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Fair and Truthful Mechanisms for Dichotomous Valuations.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Pricing Multi-Unit Markets.
ACM Trans. Economics and Comput., 2020

A general framework for endowment effects in combinatorial markets.
SIGecom Exch., 2020

Secretary Matching with General Arrivals.
CoRR, 2020

Online Stochastic Max-Weight 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
Complement-Free Couples Must Communicate: A Hardness Result for Two-Player Combinatorial Auctions.
CoRR, 2018

Prophets and Secretaries with Overbooking.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

2017
Pricing Identical Items.
CoRR, 2017

Pricing social goods.
Proceedings of the 12th workshop on the Economics of Networks, Systems and Computation, 2017


  Loading...