default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Freund 0001
Person information
- affiliation: MIT, Cambridge, MA, USA
- affiliation (former): Cornell University
Other persons with the same name
- Daniel Freund 0002 — TU Berlin, DAI-Labor
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i13]Benjamin Barrientos, Daniel Freund, Daniela Sabán:
Online matching and market imbalance. CoRR abs/2502.07731 (2025)- 2024
- [j12]Daniel Freund:
Technical Perspective: Improving Refugees' Integration with Online Resource Allocation. Commun. ACM 67(5): 9898 (2024) - [j11]Daniel Freund
, Thodoris Lykouris, Wentao Weng:
Efficient Decentralized Multi-agent Learning in Asymmetric Bipartite Queueing Systems. Oper. Res. 72(3): 1049-1070 (2024) - [c15]Daniel Freund, Ilan Lobel, Jiayu (Kamessi) Zhao:
On the Supply of Autonomous Vehicles in Platforms. EC 2024: 2 - [c14]Daniel Freund, Wentao Weng:
The Dedicated Docket in U.S. Immigration Courts: An analysis of fairness and efficiency properties. EC 2024: 346 - 2023
- [j10]Daniel Freund, Jiayu (Kamessi) Zhao:
Overbooking with Bounded Loss. Math. Oper. Res. 48(3): 1344-1363 (2023) - [j9]Alice Paul, Daniel Freund, Aaron M. Ferber, David B. Shmoys, David P. Williamson:
Erratum to "Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems". Math. Oper. Res. 48(4): 2304-2307 (2023) - [c13]Daniel Freund, Thodoris Lykouris, Wentao Weng:
Quantifying the Cost of Learning in Queueing Systems. NeurIPS 2023 - [c12]Daniel Freund, Thodoris Lykouris, Elisabeth Paulson, Bradley Sturt, Wentao Weng:
Group fairness in dynamic refugee assignment. EC 2023: 701 - [i12]Daniel Freund, Thodoris Lykouris, Elisabeth Paulson, Bradley Sturt, Wentao Weng:
Group fairness in dynamic refugee assignment. CoRR abs/2301.10642 (2023) - [i11]Daniel Freund, Samuel B. Hopkins:
Towards Practical Robustness Auditing for Linear Regression. CoRR abs/2307.16315 (2023) - [i10]Daniel Freund, Thodoris Lykouris, Wentao Weng:
Quantifying the Cost of Learning in Queueing Systems. CoRR abs/2308.07817 (2023) - 2022
- [j8]Siddhartha Banerjee, Daniel Freund, Thodoris Lykouris:
Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework. Oper. Res. 70(3): 1783-1805 (2022) - [j7]Daniel Freund, Shane G. Henderson, David B. Shmoys:
Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems. Oper. Res. 70(5): 2715-2731 (2022) - [c11]Daniel Freund, Thodoris Lykouris, Wentao Weng:
Efficient decentralized multi-agent learning in asymmetric queuing systems. COLT 2022: 4080-4084 - [i9]Daniel Freund, Thodoris Lykouris, Wentao Weng:
Efficient decentralized multi-agent learning in asymmetric queuing systems. CoRR abs/2206.03324 (2022) - 2021
- [j6]Hao Yi Ong, Daniel Freund, Davide Crapis:
Driver Positioning and Incentive Budgeting with an Escrow Mechanism for Ride-Sharing Platforms. INFORMS J. Appl. Anal. 51(5): 373-390 (2021) - [c10]Daniel Freund, Jiayu (Kamessi) Zhao:
Overbooking with Bounded Loss. EC 2021: 477-478 - [i8]Hao Yi Ong, Daniel Freund, Davide Crapis:
Driver Positioning and Incentive Budgeting with an Escrow Mechanism for Ridesharing Platforms. CoRR abs/2104.14740 (2021) - [i7]Daniel Freund, Chamsi Hssaine:
Earning Sans Learning: Noisy Decision-Making and Labor Supply on Gig Economy Platforms. CoRR abs/2111.00002 (2021) - 2020
- [j5]Alice Paul, Daniel Freund, Aaron M. Ferber, David B. Shmoys, David P. Williamson:
Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems. Math. Oper. Res. 45(2): 576-590 (2020) - [c9]Siddhartha Banerjee, Daniel Freund:
Uniform Loss Algorithms for Online Stochastic Decision-Making With Applications to Bin Packing. SIGMETRICS (Abstracts) 2020: 1-2
2010 – 2019
- 2019
- [j4]Carla P. Gomes, Thomas G. Dietterich, Christopher Barrett, Jon Conrad, Bistra Dilkina, Stefano Ermon, Fei Fang, Andrew Farnsworth, Alan Fern, Xiaoli Z. Fern, Daniel Fink, Douglas H. Fisher, Alexander Flecker, Daniel Freund, Angela Fuller, John M. Gregoire, John E. Hopcroft, Steve Kelling, J. Zico Kolter, Warren B. Powell, Nicole D. Sintov, John S. Selker, Bart Selman, Daniel Sheldon, David B. Shmoys, Milind Tambe, Weng-Keen Wong, Christopher Wood, Xiaojian Wu, Yexiang Xue, Amulya Yadav, Abdul-Aziz Yakubu, Mary Lou Zeeman:
Computational sustainability: computing for a better world and a sustainable future. Commun. ACM 62(9): 56-65 (2019) - [j3]Daniel Freund, David P. Williamson:
Rank aggregation: New bounds for MCx. Discret. Appl. Math. 252: 28-36 (2019) - [j2]Daniel Freund, Shane G. Henderson, Eoin O'Mahony, David B. Shmoys:
Analytics and Bikes: Riding Tandem with Motivate to Improve Mobility. INFORMS J. Appl. Anal. 49(5): 310-323 (2019) - 2018
- [j1]Daniel Freund, Matthias Poloczek, Daniel Reichman:
Contagious sets in dense graphs. Eur. J. Comb. 68: 66-78 (2018) - [c8]Hangil Chung, Daniel Freund, David B. Shmoys:
Bike Angels: An Analysis of Citi Bike's Incentive Program. COMPASS 2018: 5:1-5:9 - 2017
- [c7]Alice Paul, Daniel Freund, Aaron M. Ferber, David B. Shmoys, David P. Williamson:
Prize-Collecting TSP with a Budget Constraint. ESA 2017: 62:1-62:14 - [c6]Daniel Freund, Shane G. Henderson, David B. Shmoys:
Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems. IPCO 2017: 186-198 - [c5]Siddhartha Banerjee, Daniel Freund, Thodoris Lykouris:
Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework. EC 2017: 517 - 2016
- [c4]Nanjing Jian, Daniel Freund, Holly M. Wiberg, Shane G. Henderson:
Simulation optimization for a large-scale bike-sharing system. WSC 2016: 602-613 - [i6]Siddhartha Banerjee, Daniel Freund, Thodoris Lykouris:
Multi-objective pricing for shared vehicle systems. CoRR abs/1608.06819 (2016) - [i5]Daniel Freund, Shane G. Henderson, David B. Shmoys:
Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems. CoRR abs/1611.09304 (2016) - 2015
- [c3]Daniel Freund, Matthias Poloczek, Daniel Reichman:
Contagious Sets in Dense Graphs. IWOCA 2015: 185-196 - [c2]Ben A. Fisch, Daniel Freund, Moni Naor:
Secure Physical Computation Using Disposable Circuits. TCC (1) 2015: 182-198 - [i4]Daniel Freund, David P. Williamson:
MC4, Copeland and restart probabilities. CTW 2015: 5-8 - [i3]Daniel Freund, Matthias Poloczek, Daniel Reichman:
Contagious Sets in Dense Graphs. CoRR abs/1503.00158 (2015) - [i2]Daniel Freund, David P. Williamson:
Rank Aggregation: New Bounds for MCx. CoRR abs/1510.00738 (2015) - [i1]Ben Fisch, Daniel Freund, Moni Naor:
Secure Physical Computation using Disposable Circuits. IACR Cryptol. ePrint Arch. 2015: 226 (2015) - 2014
- [c1]Ben Fisch, Daniel Freund, Moni Naor:
Physical Zero-Knowledge Proofs of Physical Properties. CRYPTO (2) 2014: 313-336
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 2025-03-13 21:29 CET 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:
