default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomer Ezra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]Ben Berger, Tomer Ezra, Michal Feldman, Federico Fusco:
Pandora's Problem with Deadlines. AAAI 2024: 20337-20343- [c22]Tomer Ezra, Stefano Leonardi, Michal Pawlowski, Matteo Russo, Seeun William Umboh:
Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment. APPROX/RANDOM 2024: 12:1-12:24 - [c21]Tomer Ezra
, Michal Feldman, Maya Schlesinger:
On the (In)approximability of Combinatorial Contracts. ITCS 2024: 44:1-44:22 - [c20]Georgios Birmpas, Tomer Ezra, Stefano Leonardi, Matteo Russo:
Fair Division with Interdependent Values. SAGT 2024: 72-88 - [i29]Johannes Brustle, José Correa, Paul Dütting, Tomer Ezra, Michal Feldman, Victor Verdugo:
The Competition Complexity of Prophet Inequalities. CoRR abs/2402.11084 (2024) - [i28]Tomer Ezra, Stefano Leonardi, Matteo Russo:
Contracts with Inspections. CoRR abs/2402.16553 (2024) - [i27]Tomer Ezra, Daniel Schoepflin, Ariel Shaulker:
Optimal Mechanisms for Consumer Surplus Maximization. CoRR abs/2402.16972 (2024) - [i26]Tomer Ezra, Michal Feldman, Zhihao Gavin Tang:
Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms. CoRR abs/2402.17160 (2024) - [i25]Tomer Ezra, Michal Feldman, Maya Schlesinger:
Sequential Contracts. CoRR abs/2403.09545 (2024) - [i24]Paul Duetting, Tomer Ezra, Michal Feldman, Thomas Kesselheim:
Multi-Agent Combinatorial Contracts. CoRR abs/2405.08260 (2024) - [i23]Tomer Ezra, Stefano Leonardi, Michal Pawlowski, Matteo Russo, Seeun William Umboh:
Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment. CoRR abs/2407.15809 (2024) - [i22]Tomer Ezra:
Prophet Inequality from Samples: Is the More the Merrier? CoRR abs/2409.00559 (2024) - [i21]Tomer Ezra, Tamar Garbuz:
The Competition Complexity of Prophet Inequalities with Correlations. CoRR abs/2409.06868 (2024) - 2023
- [c19]Ben Berger, Tomer Ezra, Michal Feldman, Federico Fusco:
Pandora's Problem with Combinatorial Cost. EC 2023: 273-292 - [c18]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
"Who is Next in Line?" On the Significance of Knowing the Arrival Order in Bayesian Online Settings. SODA 2023: 3759-3776 - [c17]Paul Dütting, Tomer Ezra, Michal Feldman, Thomas Kesselheim:
Multi-agent Contracts. STOC 2023: 1311-1324 - [c16]Tomer Ezra, Tamar Garbuz:
The Importance of Knowing the Arrival Order in Combinatorial Bayesian Settings. WINE 2023: 256-271 - [c15]Tomer Ezra, Stefano Leonardi, Rebecca Reiffenhäuser, Matteo Russo, Alexandros Tsigonias-Dimitriadis:
Prophet Inequalities via the Expected Competitive Ratio. WINE 2023: 272-289 - [i20]Ben Berger, Tomer Ezra, Michal Feldman, Federico Fusco:
Pandora's Problem with Combinatorial Cost. CoRR abs/2303.01078 (2023) - [i19]Georgios Birmpas, Tomer Ezra, Stefano Leonardi, Matteo Russo:
Fair Division with Interdependent Values. CoRR abs/2305.14096 (2023) - [i18]Tomer Ezra, Tamar Garbuz:
The Importance of Knowing the Arrival Order in Combinatorial Bayesian Settings. CoRR abs/2307.02610 (2023) - [i17]Tomer Ezra, Michal Feldman, Maya Schlesinger:
On the (In)approximability of Combinatorial Contracts. CoRR abs/2311.18425 (2023) - 2022
- [j3]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
Prophet Matching with General Arrivals. Math. Oper. Res. 47(2): 878-898 (2022) - [c14]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching. EC 2022: 1148-1177 - [c13]Moshe Babaioff, Tomer Ezra, Uriel Feige:
On Best-of-Both-Worlds Fair-Share Allocations. WINE 2022: 237-255 - [i16]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
On the Significance of Knowing the Arrival Order in Prophet Inequality. CoRR abs/2202.09215 (2022) - [i15]Tomer Ezra, Stefano Leonardi, Rebecca Reiffenhäuser, Matteo Russo, Alexandros Tsigonias-Dimitriadis:
Prophet Inequalities via the Expected Competitive Ratio. CoRR abs/2207.03361 (2022) - [i14]Paul Duetting, Tomer Ezra, Michal Feldman, Thomas Kesselheim:
Multi-Agent Contracts. CoRR abs/2211.05434 (2022) - 2021
- [b1]Tomer Ezra:
Simple Mechanisms for Limited Information Settings. Tel Aviv University, Israel, 2021 - [c12]Moshe Babaioff, Tomer Ezra, Uriel Feige:
Fair and Truthful Mechanisms for Dichotomous Valuations. AAAI 2021: 5119-5126 - [c11]Paul Dütting, Tomer Ezra, Michal Feldman, Thomas Kesselheim:
Combinatorial Contracts. FOCS 2021: 815-826 - [c10]Tomer Ezra, Michal Feldman, Ron Kupfer:
On a Competitive Secretary Problem with Deferred Selections. IJCAI 2021: 175-181 - [c9]Tomer Ezra, Michal Feldman, Ron Kupfer:
Prophet Inequality with Competing Agents. SAGT 2021: 112-123 - [c8]Moshe Babaioff, Tomer Ezra, Uriel Feige:
Fair-Share Allocations for Agents with Arbitrary Entitlements. EC 2021: 127 - [i13]Moshe Babaioff, Tomer Ezra, Uriel Feige:
Best-of-Both-Worlds Fair-Share Allocations. CoRR abs/2102.04909 (2021) - [i12]Moshe Babaioff, Tomer Ezra, Uriel Feige:
Fair-Share Allocations for Agents with Arbitrary Entitlements. CoRR abs/2103.04304 (2021) - [i11]Tomer Ezra, Michal Feldman, Ron Kupfer:
Prophet Inequality with Competing Agents. CoRR abs/2107.00357 (2021) - [i10]Paul Duetting, Tomer Ezra, Michal Feldman, Thomas Kesselheim:
Combinatorial Contracts. CoRR abs/2109.14260 (2021) - 2020
- [j2]Tomer Ezra, Michal Feldman, Ophir Friedler:
A general framework for endowment effects in combinatorial markets. SIGecom Exch. 18(2): 38-44 (2020) - [j1]Tomer Ezra, Michal Feldman, Tim Roughgarden, Warut Suksompong:
Pricing Multi-Unit Markets. ACM Trans. Economics and Comput. 7(4): 20:1-20:29 (2020) - [c7]Tomer Ezra, Michal Feldman, Ophir Friedler:
A General Framework for Endowment Effects in Combinatorial Markets. EC 2020: 499-500 - [c6]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
Online Stochastic Max-Weight Matching: Prophet Inequality for Vertex and Edge Arrival Models. EC 2020: 769-787 - [i9]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
Online Stochastic Max-Weight Matching: prophet inequality for vertex and edge arrival models. CoRR abs/2002.09807 (2020) - [i8]Moshe Babaioff, Tomer Ezra, Uriel Feige:
Fair and Truthful Mechanisms for Dichotomous Valuations. CoRR abs/2002.10704 (2020) - [i7]Tomer Ezra, Michal Feldman, Ron Kupfer:
On a Competitive Secretary Problem with Deferred Selections. CoRR abs/2007.07216 (2020) - [i6]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
Secretary Matching with General Arrivals. CoRR abs/2011.01559 (2020)
2010 – 2019
- 2019
- [c5]Tomer Ezra, Michal Feldman, Eric Neyman, Inbal Talgam-Cohen, S. Matthew Weinberg:
Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers. FOCS 2019: 249-272 - [i5]Tomer Ezra, Michal Feldman, Ophir Friedler:
A General Framework for Endowment Effects in Combinatorial Markets. CoRR abs/1903.11360 (2019) - 2018
- [c4]Tomer Ezra, Michal Feldman, Ilan Nehama:
Prophets and Secretaries with Overbooking. EC 2018: 319-320 - [c3]Tomer Ezra, Michal Feldman, Tim Roughgarden, Warut Suksompong:
Pricing Multi-unit Markets. WINE 2018: 140-153 - [i4]Tomer Ezra, Michal Feldman, Ilan Nehama:
Prophets and Secretaries with Overbooking. CoRR abs/1805.05094 (2018) - [i3]Tomer Ezra, Michal Feldman, Eric Neyman, Inbal Talgam-Cohen, S. Matthew Weinberg:
Complement-Free Couples Must Communicate: A Hardness Result for Two-Player Combinatorial Auctions. CoRR abs/1811.09871 (2018) - 2017
- [c2]Alon Eden, Tomer Ezra, Michal Feldman:
Pricing Social Goods. ESA 2017: 35:1-35:14 - [c1]Alon Eden, Tomer Ezra, Michal Feldman:
Pricing social goods. NetEcon@EC 2017: 10:1 - [i2]Tomer Ezra, Michal Feldman, Tim Roughgarden, Warut Suksompong:
Pricing Identical Items. CoRR abs/1705.06623 (2017) - [i1]Alon Eden, Tomer Ezra, Michal Feldman:
Pricing Social Goods. CoRR abs/1706.10009 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-14 23:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
