default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicholas Teh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Davin Choo
, Yan Hao Ling, Warut Suksompong, Nicholas Teh, Jian Zhang:
Envy-free house allocation with minimum subsidy. Oper. Res. Lett. 54: 107103 (2024)- [c13]Luisa Montanari, Ulrike Schmidt-Kraepelin, Warut Suksompong, Nicholas Teh:
Weighted Envy-Freeness for Submodular Valuations. AAAI 2024: 9865-9873 - [c12]Edith Elkind, Svetlana Obraztsova, Nicholas Teh:
Temporal Fairness in Multiwinner Voting. AAAI 2024: 22633-22640 - [c11]Tzeh Yuan Neoh, Nicholas Teh:
Welfare Maximization in Perpetual Voting (Student Abstract). AAAI 2024: 23597-23599 - [c10]Edith Elkind, Svetlana Obraztsova, Nicholas Teh:
Verifying Proportionality in Temporal Voting. AAMAS 2024: 2246-2248 - [c9]Nicholas Teh:
Distributive and Temporal Fairness in Algorithmic Collective Decision-Making. AAMAS 2024: 2779-2781 - [c8]Valentin Zech, Niclas Boehmer, Edith Elkind, Nicholas Teh:
Multiwinner Temporal Voting with Aversion to Change. ECAI 2024: 3236-3243 - [c7]Edith Elkind, Tzeh Yuan Neoh, Nicholas Teh:
Temporal Elections: Welfare, Strategyproofness, and Proportionality. ECAI 2024: 3292-3299 - [c6]Edith Elkind, Ayumi Igarashi, Nicholas Teh:
Fair Division of Chores with Budget Constraints. SAGT 2024: 55-71 - [i13]Davin Choo, Yan Hao Ling, Warut Suksompong, Nicholas Teh, Jian Zhang:
Envy-Free House Allocation with Minimum Subsidy. CoRR abs/2403.01162 (2024) - [i12]Valentin Zech, Niclas Boehmer, Edith Elkind, Nicholas Teh:
Multiwinner Temporal Voting with Aversion to Change. CoRR abs/2408.11017 (2024) - [i11]Edith Elkind, Tzeh Yuan Neoh, Nicholas Teh:
Temporal Elections: Welfare, Strategyproofness, and Proportionality. CoRR abs/2408.13637 (2024) - [i10]Edith Elkind, Alexander Lam, Mohamad Latifian, Tzeh Yuan Neoh, Nicholas Teh:
Temporal Fair Division of Indivisible Items. CoRR abs/2410.14593 (2024) - [i9]Edith Elkind, Ayumi Igarashi, Nicholas Teh:
Fair Division of Chores with Budget Constraints. CoRR abs/2410.23979 (2024) - [i8]Jiarui Gan, Abheek Ghosh, Nicholas Teh:
Persuading a Credible Agent. CoRR abs/2410.23989 (2024) - 2023
- [j2]Warut Suksompong, Nicholas Teh:
Weighted fair division with matroid-rank valuations: Monotonicity and strategyproofness. Math. Soc. Sci. 126: 48-59 (2023) - [c5]Jonathan Scarlett, Nicholas Teh, Yair Zick:
For One and All: Individual and Group Fairness in the Allocation of Indivisible Goods. AAMAS 2023: 2466-2468 - [c4]Edith Elkind, Warut Suksompong, Nicholas Teh:
Settling the Score: Portioning with Cardinal Preferences. ECAI 2023: 621-628 - [i7]Jonathan Scarlett, Nicholas Teh, Yair Zick:
For One and All: Individual and Group Fairness in the Allocation of Indivisible Goods. CoRR abs/2302.06958 (2023) - [i6]Warut Suksompong, Nicholas Teh:
Weighted Fair Division with Matroid-Rank Valuations: Monotonicity and Strategyproofness. CoRR abs/2303.14454 (2023) - [i5]Edith Elkind, Warut Suksompong, Nicholas Teh:
Settling the Score: Portioning with Cardinal Preferences. CoRR abs/2307.15586 (2023) - [i4]Edith Elkind, Svetlana Obraztsova, Nicholas Teh:
Temporal Fairness in Multiwinner Voting. CoRR abs/2312.04417 (2023) - 2022
- [j1]Warut Suksompong, Nicholas Teh:
On maximum weighted Nash welfare for binary valuations. Math. Soc. Sci. 117: 101-108 (2022) - [c3]Shiri Alouf-Heffetz, Laurent Bulteau, Edith Elkind, Nimrod Talmon, Nicholas Teh:
Better Collective Decisions via Uncertainty Reduction. IJCAI 2022: 24-30 - [c2]Edith Elkind, Sonja Kraiczy, Nicholas Teh:
Fairness in Temporal Slot Assignment. SAGT 2022: 490-507 - [i3]Warut Suksompong, Nicholas Teh:
On Maximum Weighted Nash Welfare for Binary Valuations. CoRR abs/2204.03803 (2022) - [i2]Shiri Alouf-Heffetz, Laurent Bulteau, Edith Elkind, Nimrod Talmon, Nicholas Teh:
Better Collective Decisions via Uncertainty Reduction. CoRR abs/2207.04983 (2022) - [i1]Luisa Montanari, Ulrike Schmidt-Kraepelin, Warut Suksompong, Nicholas Teh:
Weighted Envy-Freeness for Submodular Valuations. CoRR abs/2209.06437 (2022) - 2021
- [c1]Nicholas Teh, Shuyue Hu, Harold Soh:
A Theoretical Framework for Large-Scale Human-Robot Interaction with Groups of Learning Agents. HRI (Companion) 2021: 489-493
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-01-16 22:04 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:
