Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Schoepflin 0001
Person information
- affiliation: Rutgers University, DIMACS, NJ, USA
- affiliation (former): Drexel University, Philadelphia, PA, USA
Other persons with the same name
- Daniel Schoepflin 0002
![[0000-0003-3912-1128]](https://dblp.org/img/orcid-mark.12x12.png "0000-0003-3912-1128")
— Hamburg University of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i7]Tomer Ezra, Daniel Schoepflin, Ariel Shaulker:
Optimal Mechanisms for Consumer Surplus Maximization. CoRR abs/2402.16972 (2024)- 2022
- [c7]Ioannis Caragiannis, Vasilis Gkatzelis, Alexandros Psomas, Daniel Schoepflin:
Beyond Cake Cutting: Allocating Homogeneous Divisible Goods. AAMAS 2022: 208-216 - [c6]Giorgos Christodoulou, Vasilis Gkatzelis, Daniel Schoepflin:
Optimal Deterministic Clock Auctions and Beyond. ITCS 2022: 49:1-49:23 - [c5]Michal Feldman, Vasilis Gkatzelis, Nick Gravin, Daniel Schoepflin:
Bayesian and Randomized Clock Auctions. EC 2022: 820-845 - [c4]Eric Balkanski, Pranav Garimidi, Vasilis Gkatzelis, Daniel Schoepflin, Xizhi Tan:
Deterministic Budget-Feasible Clock Auctions. SODA 2022: 2940-2963 - [i6]Ioannis Caragiannis, Vasilis Gkatzelis, Alexandros Psomas, Daniel Schoepflin:
Beyond Cake Cutting: Allocating Homogeneous Divisible Goods. CoRR abs/2201.04662 (2022) - [i5]Michal Feldman, Vasilis Gkatzelis, Nick Gravin, Daniel Schoepflin:
Bayesian and Randomized Clock Auctions. CoRR abs/2202.09291 (2022) - 2021
- [c3]Artem Baklanov, Pranav Garimidi, Vasilis Gkatzelis, Daniel Schoepflin:
Achieving Proportionality up to the Maximin Item with Indivisible Goods. AAAI 2021: 5143-5150 - [c2]Artem Baklanov, Pranav Garimidi, Vasilis Gkatzelis, Daniel Schoepflin:
PROPm Allocations of Indivisible Goods to Multiple Agents. IJCAI 2021: 24-30 - [c1]Vasilis Gkatzelis, Rishi Patel, Emmanouil Pountourakis, Daniel Schoepflin:
Prior-Free Clock Auctions for Bidders with Interdependent Values. SAGT 2021: 64-78 - [i4]Artem Baklanov, Pranav Garimidi, Vasilis Gkatzelis, Daniel Schoepflin:
PROPm Allocations of Indivisible Goods to Multiple Agents. CoRR abs/2105.11348 (2021) - [i3]Eric Balkanski, Pranav Garimidi, Vasilis Gkatzelis, Daniel Schoepflin, Xizhi Tan:
Deterministic Budget-Feasible Clock Auctions. CoRR abs/2107.09239 (2021) - [i2]Vasilis Gkatzelis, Rishi Patel, Emmanouil Pountourakis, Daniel Schoepflin:
Prior-Free Clock Auctions for Bidders with Interdependent Values. CoRR abs/2107.09247 (2021) - 2020
- [i1]Artem Baklanov, Pranav Garimidi, Vasilis Gkatzelis, Daniel Schoepflin:
Achieving Proportionality up to the Maximin Item with Indivisible Goods. CoRR abs/2009.09508 (2020)
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-04-25 05:45 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:
