default search action
Daniela Sabán
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [i5]Benjamin Barrientos, Daniel Freund, Daniela Sabán:
Online matching and market imbalance. CoRR abs/2502.07731 (2025) - 2024
- [j19]Kostas Bimpikis
, Ilan Morgenstern
Data Tracking Under Competition. Oper. Res. 72(2): 514-532 (2024) - [e1]Dirk Bergemann, Robert Kleinberg, Daniela Sabán:
Proceedings of the 25th ACM Conference on Economics and Computation, EC 2024, New Haven, CT, USA, July 8-11, 2024. ACM 2024, ISBN 979-8-4007-0704-9 [contents] - 2023
- [j18]Ali Aouad
Online Assortment Optimization for Two-Sided Matching Platforms. Manag. Sci. 69(4): 2069-2087 (2023) - [j17]Yonatan Gur
Information Disclosure and Promotion Policy Design for Platforms. Manag. Sci. 69(10): 5883-5903 (2023) - [j16]Je-ok Choi
The Design of Optimal Pay-as-Bid Procurement Mechanisms. Manuf. Serv. Oper. Manag. 25(2): 613-630 (2023) - [j15]Ignacio Rios
Improving Match Rates in Dating Markets Through Assortment Optimization. Manuf. Serv. Oper. Manag. 25(4): 1304-1323 (2023) - 2022
- [j14]Itai Ashlagi, Anilesh K. Krishnaswamy, Rahul Makhijani, Daniela Sabán
Technical Note - Assortment Planning for Two-Sided Sequential Matching Markets. Oper. Res. 70(5): 2784-2803 (2022) - [j13]Yonatan Gur
Sequential Procurement with Contractual and Experimental Learning. Manag. Sci. 68(4): 2714-2731 (2022) - [c14]Vahideh H. Manshadi, Scott Rodilitz, Daniela Sabán, Akshaya Suresh:
Online Algorithms for Matching Platforms with Multi-Channel Traffic. EC 2022: 986-987 - [i4]Vahideh H. Manshadi, Scott Rodilitz, Daniela Sabán, Akshaya Suresh:
Online Algorithms for Matching Platforms with Multi-Channel Traffic. CoRR abs/2203.15037 (2022) - 2021
- [j12]Daniela Sabán
Procurement Mechanisms for Assortments of Differentiated Products. Oper. Res. 69(3): 795-820 (2021) - [j11]Yash Kanoria
Facilitating the Search for Partners on Matching Platforms. Manag. Sci. 67(10): 5990-6029 (2021) - [j10]Ruth Beer
Increased Transparency in Procurement: The Role of Peer Effects. Manag. Sci. 67(12): 7511-7534 (2021) - [j9]John R. Birge
Optimal Commissions and Subscriptions in Networked Markets. Manuf. Serv. Oper. Manag. 23(3): 569-588 (2021) - [c13]Ali Aouad, Daniela Sabán:
Online Assortment Optimization for Two-sided Matching Platforms. EC 2021: 91-92 - [c12]Kostas Bimpikis, Ilan Morgenstern, Daniela Sabán:
Data Tracking under Competition. EC 2021: 137 - [c11]Ignacio Rios, Daniela Sabán, Fanyin Zheng:
Improving Match Rates in Dating Markets through Assortment Optimization. EC 2021: 788-789 - [c10]Yonatan Gur, Gregory Macnamara, Ilan Morgenstern, Daniela Sabán:
Confounding Equilibria for Platforms with Private Information on Promotion Value. WINE 2021: 555 - 2020
- [c9]Itai Ashlagi, Anilesh K. Krishnaswamy, Rahul Makhijani, Daniela Sabán, Kirankumar Shiragur:
Assortment Planning for Two-Sided Sequential Matching Markets. WINE 2020: 475
2010 – 2019
- 2019
- [j8]Kostas Bimpikis
Spatial Pricing in Ride-Sharing Networks. Oper. Res. 67(3): 744-769 (2019) - [i3]Itai Ashlagi, Anilesh K. Krishnaswamy, Rahul Makhijani, Daniela Sabán, Kirankumar Shiragur:
Assortment planning for two-sided sequential matching markets. CoRR abs/1907.04485 (2019) - 2018
- [j7]Yash Kanoria
Convergence of the Core in Assignment Markets. Oper. Res. 66(3): 620-636 (2018) - [j6]Yonatan Gur, Daniela Sabán, Nicolás E. Stier Moses
Technical Note - The Competitive Facility Location Problem in a Duopoly: Advances Beyond Trees. Oper. Res. 66(4): 1058-1067 (2018) - [c8]John R. Birge
Optimal Commissions and Subscriptions in Networked Markets. EC 2018: 613-614 - 2017
- [c7]Kostas Bimpikis, Ozan Candogan, Daniela Sabán:
Spatial pricing in ride-sharing networks. NetEcon@EC 2017: 5:1 - [c6]Yash Kanoria, Daniela Sabán:
Facilitating the Search for Partners on Matching Platforms: Restricting Agent Actions. EC 2017: 117 - [i2]Hedyeh Beyhaghi, Daniela Sabán, Éva Tardos:
Effect of selfish choices in deferred acceptance with short lists. CoRR abs/1701.00849 (2017) - 2015
- [j5]Daniela Sabán, Jay Sethuraman:
The Complexity of Computing the Random Priority Allocation Matrix. Math. Oper. Res. 40(4): 1005-1014 (2015) - [c5]Daniela Sabán, Gabriel Y. Weintraub:
Procurement Mechanisms for Differentiated Products. EC 2015: 509 - [c4]Yash Kanoria, Daniela Sabán, Jay Sethuraman:
The size of the core in assignment markets. SODA 2015: 1916-1924 - 2014
- [i1]Yash Kanoria, Daniela Sabán, Jay Sethuraman:
The size of the core in assignment markets. CoRR abs/1407.2576 (2014) - 2013
- [c3]Daniela Sabán, Jay Sethuraman:
House allocation with indifferences: a generalization and a unified view. EC 2013: 803-820 - [c2]Daniela Sabán, Jay Sethuraman:
The Complexity of Computing the Random Priority Allocation Matrix. WINE 2013: 421 - 2012
- [j4]Flavia Bonomo
A polyhedral study of the maximum edge subgraph problem. Discret. Appl. Math. 160(18): 2573-2590 (2012) - [j3]Flavia Bonomo, Andrés Cardemil, Guillermo Durán, Javier Marenco, Daniela Sabán:
An Application of the Traveling Tournament Problem: The Argentine Volleyball League. Interfaces 42(3): 245-259 (2012) - [c1]Daniela Sabán, Nicolás Stier Moses
The Competitive Facility Location Problem in a Duopoly: Connections to the 1-Median Problem. WINE 2012: 539-545 - 2011
- [j2]Javier Marenco, Daniela Sabán:
Combinatorial properties and further facets of maximum edge subgraph polytopes. Electron. Notes Discret. Math. 37: 303-308 (2011)
2000 – 2009
- 2009
- [j1]Flavia Bonomo, Javier Marenco, Daniela Sabán, Nicolás Stier Moses
A polyhedral study of the maximum edge subgraph problem. Electron. Notes Discret. Math. 35: 197-202 (2009)
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 20:17 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: