default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Halpern 0002
Person information
- affiliation: Harvard University, MA, USA
- affiliation: University of Toronto, ON, Canada
Other persons with the same name
- Daniel Halpern — disambiguation page
- Daniel Halpern 0001 (aka: Daniel Halpern Jelin) — Pontificia Universidad Católica de Chile, Santiago, Chile
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c19]Daniel Halpern, Ariel D. Procaccia, Ehud Shapiro, Nimrod Talmon:
Federated Assemblies. AAAI 2025: 13897-13904- [i14]Daniel Halpern, Alexandros Psomas, Paritosh Verma, Daniel Xie:
Online Envy Minimization and Multicolor Discrepancy: Equivalences and Separations. CoRR abs/2502.14624 (2025) - 2024
- [c18]Soroush Ebadian, Daniel Halpern, Evi Micha:
Metric Distortion with Elicited Pairwise Comparisons. IJCAI 2024: 2791-2798 - [c17]Luise Ge, Daniel Halpern, Evi Micha, Ariel D. Procaccia, Itai Shapira, Yevgeniy Vorobeychik, Junlin Wu:
Axioms for AI Alignment from Human Feedback. NeurIPS 2024 - [c16]Daniel Halpern
, Safwan Hossain, Jamie Tucker-Foltz:
Computing Voting Rules with Elicited Incomplete Votes. EC 2024: 941-963 - [c15]Gerdus Benade, Daniel Halpern, Alexandros Psomas, Paritosh Verma:
On the Existence of Envy-Free Allocations Beyond Additive Valuations. EC 2024: 1287 - [c14]Fabian Baumann, Daniel Halpern, Ariel D. Procaccia, Iyad Rahwan, Itai Shapira, Manuel Wüthrich:
Optimal Engagement-Diversity Tradeoffs in Social Media. WWW 2024: 288-299 - [i13]Daniel Halpern, Safwan Hossain, Jamie Tucker-Foltz:
Computing Voting Rules with Elicited Incomplete Votes. CoRR abs/2402.11104 (2024) - [i12]Luise Ge, Daniel Halpern, Evi Micha, Ariel D. Procaccia, Itai Shapira, Yevgeniy Vorobeychik, Junlin Wu:
Axioms for AI Alignment from Human Feedback. CoRR abs/2405.14758 (2024) - [i11]Daniel Halpern, Ariel D. Procaccia, Ehud Shapiro, Nimrod Talmon:
Federated Assemblies. CoRR abs/2405.19129 (2024) - 2023
- [c13]Daniel Halpern, Gregory Kehne, Ariel D. Procaccia, Jamie Tucker-Foltz, Manuel Wüthrich:
Representation with Incomplete Votes. AAAI 2023: 5657-5664 - [c12]Daniel Halpern, Rachel Li, Ariel D. Procaccia:
Strategyproof Voting under Correlated Beliefs. NeurIPS 2023 - [c11]Daniel Halpern, Joseph Y. Halpern, Ali Jadbabaie, Elchanan Mossel, Ariel D. Procaccia, Manon Revel:
In Defense of Liquid Democracy. EC 2023: 852 - [c10]Bailey Flanigan, Daniel Halpern, Alexandros Psomas:
Smoothed Analysis of Social Choice Revisited. WINE 2023: 290-309 - [i10]Fabian Baumann, Daniel Halpern, Ariel D. Procaccia, Iyad Rahwan, Itai Shapira, Manuel Wuthrich:
Optimal Engagement-Diversity Tradeoffs in Social Media. CoRR abs/2303.03549 (2023) - [i9]Gerdus Benadè, Daniel Halpern, Alexandros Psomas, Paritosh Verma:
On the Existence of Envy-Free Allocations Beyond Additive Valuations. CoRR abs/2307.09648 (2023) - 2022
- [c9]Manon Revel, Tao Lin, Daniel Halpern:
How Many Representatives Do We Need? The Optimal Size of a Congress Voting on Binary Issues. AAAI 2022: 9431-9438 - [c8]Allan Borodin, Daniel Halpern, Mohamad Latifian, Nisarg Shah:
Distortion in Voting with Top-t Preferences. IJCAI 2022: 116-122 - [c7]Daniel Halpern, Gregory Kehne, Jamie Tucker-Foltz:
Can Buyers Reveal for a Better Deal? IJCAI 2022: 314-320 - [c6]Gerdus Benadè, Daniel Halpern, Alexandros Psomas:
Dynamic Fair Division with Partial Information. NeurIPS 2022 - [i8]Bailey Flanigan, Daniel Halpern, Alexandros Psomas:
Smoothed Analysis of Social Choice Revisited. CoRR abs/2206.14684 (2022) - [i7]Daniel Halpern, Gregory Kehne, Ariel D. Procaccia, Jamie Tucker-Foltz, Manuel Wüthrich:
Representation with Incomplete Votes. CoRR abs/2211.15608 (2022) - 2021
- [c5]Daniel Halpern, Gregory Kehne, Dominik Peters, Ariel D. Procaccia, Nisarg Shah, Piotr Skowron:
Aggregating Binary Judgments Ranked by Accuracy. AAAI 2021: 5456-5463 - [c4]Daniel Halpern, Nisarg Shah:
Fair and Efficient Resource Allocation with Partial Information. IJCAI 2021: 224-230 - [i6]Daniel Halpern, Nisarg Shah:
Fair and Efficient Resource Allocation with Partial Information. CoRR abs/2105.10064 (2021) - [i5]Daniel Halpern, Gregory Kehne, Jamie Tucker-Foltz:
Can Buyers Reveal for a Better Deal? CoRR abs/2106.13882 (2021) - [i4]Manon Revel, Tao Lin, Daniel Halpern:
The Optimal Size of an Epistemic Congress. CoRR abs/2107.01042 (2021) - [i3]Daniel Halpern, Joseph Y. Halpern, Ali Jadbabaie, Elchanan Mossel, Ariel D. Procaccia, Manon Revel:
In Defense of Fluid Democracy. CoRR abs/2107.11868 (2021) - 2020
- [c3]Vasilis Gkatzelis, Daniel Halpern, Nisarg Shah:
Resolving the Optimal Metric Distortion Conjecture. FOCS 2020: 1427-1438 - [c2]Daniel Halpern, Ariel D. Procaccia, Alexandros Psomas, Nisarg Shah:
Fair Division with Binary Valuations: One Rule to Rule Them All. WINE 2020: 370-383 - [i2]Vasilis Gkatzelis, Daniel Halpern, Nisarg Shah:
Resolving the Optimal Metric Distortion Conjecture. CoRR abs/2004.07447 (2020) - [i1]Daniel Halpern, Ariel D. Procaccia, Alexandros Psomas, Nisarg Shah:
Fair Division with Binary Valuations: One Rule to Rule Them All. CoRR abs/2007.06073 (2020)
2010 – 2019
- 2019
- [c1]Daniel Halpern, Nisarg Shah:
Fair Division with Subsidy. SAGT 2019: 374-389
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-04-20 23:52 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:
