default search action
Rebecca Reiffenhäuser
Person information
- affiliation: University of Amsterdam, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Michal Feldman, Federico Fusco
, Stefano Leonardi, Simon Mauras, Rebecca Reiffenhäuser:
Truthful Matching with Online Items and Offline Agents. Algorithmica 86(5): 1600-1622 (2024) - [c12]Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser, Daniel Schmand, Giovanna Varricchio:
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games. ICALP 2024: 48:1-48:18 - [i16]Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Algorithmically Fair Maximization of Multiple Submodular Objective Functions. CoRR abs/2402.15155 (2024) - [i15]Simon Mauras, Divyarthi Mohan, Rebecca Reiffenhäuser:
Optimal Stopping with Interdependent Values. CoRR abs/2404.06293 (2024) - [i14]Georgios Amanatidis, Federico Fusco, Rebecca Reiffenhäuser, Artem Tsikiridis:
Pandora's Box Problem Over Time. CoRR abs/2407.15261 (2024) - [i13]Paul Dütting, Thomas Kesselheim, Brendan Lucier, Rebecca Reiffenhäuser, Sahil Singla:
Online Combinatorial Allocations and Auctions with Few Samples. CoRR abs/2409.11091 (2024) - 2023
- [c11]Michal Feldman, Federico Fusco
Truthful Matching with Online Items and Offline Agents. ICALP 2023: 58:1-58:20 - [c10]Georgios Amanatidis
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria. EC 2023: 67-87 - [c9]Tomer Ezra
Prophet Inequalities via the Expected Competitive Ratio. WINE 2023: 272-289 - [i12]Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria. CoRR abs/2301.13652 (2023) - [i11]Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games. CoRR abs/2311.02067 (2023) - 2022
- [j2]Georgios Amanatidis, Federico Fusco
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. J. Artif. Intell. Res. 74: 661-690 (2022) - [c8]Constantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser:
Single-Sample Prophet Inequalities via Greedy-Ordered Selection. SODA 2022: 1298-1325 - [i10]Tomer Ezra, Stefano Leonardi, Rebecca Reiffenhäuser
Prophet Inequalities via the Expected Competitive Ratio. CoRR abs/2207.03361 (2022) - [i9]Michal Feldman, Federico Fusco
Truthful Matching with Online Items and Offline Agents. CoRR abs/2211.02004 (2022) - 2021
- [c7]Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti-Spaccamela, Rebecca Reiffenhäuser
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity. ICML 2021: 231-242 - [c6]Paul Dütting, Federico Fusco
Efficient two-sided markets with limited information. STOC 2021: 1452-1465 - [c5]Georgios Amanatidis, Georgios Birmpas, Federico Fusco
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. WINE 2021: 149-166 - [i8]Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti-Spaccamela, Rebecca Reiffenhäuser:
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity. CoRR abs/2102.08327 (2021) - [i7]Rebecca Reiffenhäuser:
An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem. CoRR abs/2103.03193 (2021) - [i6]Paul Dütting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Prophet Inequalities for Matching with a Single Sample. CoRR abs/2104.02050 (2021) - [i5]Georgios Amanatidis, Georgios Birmpas, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. CoRR abs/2109.08644 (2021) - [i4]Constantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser:
Single-Sample Prophet Inequalities via Greedy-Ordered Selection. CoRR abs/2111.03174 (2021) - 2020
- [c4]Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. NeurIPS 2020 - [i3]Paul Dütting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
Efficient Two-Sided Markets with Limited Information. CoRR abs/2003.07503 (2020) - [i2]Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. CoRR abs/2007.05014 (2020)
2010 – 2019
- 2019
- [c3]Rebecca Reiffenhäuser
An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem. SODA 2019: 1982-1993 - 2017
- [j1]Yossi Azar, Martin Hoefer, Idan Maor, Rebecca Reiffenhäuser
Truthful mechanism design via correlated tree rounding. Math. Program. 163(1-2): 445-469 (2017) - [i1]Paresh Nakhe, Rebecca Reiffenhäuser:
Trend Detection based Regret Minimization for Bandit Problems. CoRR abs/1709.05156 (2017) - 2016
- [c2]Paresh Nakhe, Rebecca Reiffenhäuser
Trend Detection Based Regret Minimization for Bandit Problems. DSAA 2016: 263-271 - 2015
- [c1]Yossi Azar
Truthful Mechanism Design via Correlated Tree Rounding. EC 2015: 415-432
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-15 20:47 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: