activity
20242026
most citedTemporal Elections: Welfare, Strategyproofness, and Proportionality

2 citations · 3 across the 15 of their papers we have counts for

collaborators

16 papers

cs.GT2026

Strengthening Proportionality in Participatory Budgeting with Additive Utilities

Tzeh Yuan Neoh, Nicholas Teh

Proportional representation is a central goal in participatory budgeting, where voters select public projects subject to a shared budget. Full justified representation (FJR) accoun…

cs.GT2026

Closing Gaps in Online Fair Division

Tzeh Yuan Neoh, Nicholas Teh

We study the online fair division of indivisible items, where items arrive one at a time and must be allocated immediately and irrevocably. We address three central open questions…

cs.GT2026

Efficient Ensemble Selection from Binary and Pairwise Feedback

Tzeh Yuan Neoh, Nicholas Teh, Je Qin Chooi +2

Organizations increasingly deploy multiple AI systems across task domains, but selecting a small, high-performing ensemble can require costly model calls, benchmark runs, and human…

cs.AI2026

Online Allocation with Unknown Shared Supply

Tzeh Yuan Neoh, Davin Choo, Mengchu Yue +1

Many real-world resource allocation systems, such as humanitarian logistics and vaccine distribution, must preposition limited supply across multiple locations before demand is rea…

cs.AI2026

Incentive-Aware AI Safety via Strategic Resource Allocation: A Stackelberg Security Games Perspective

Cheol Woo Kim, Davin Choo, Tzeh Yuan Neoh +1

As AI systems grow more capable and autonomous, ensuring their safety and reliability requires not only model-level alignment but also strategic oversight of the humans and institu…

cs.GT2026

The Cost of EFX: Generalized-Mean Welfare and Complexity Dichotomies with Few Surplus Items

Eugene Lim, Tzeh Yuan Neoh, Nicholas Teh

Envy-freeness up to any good (EFX) is a central fairness notion for allocating indivisible goods, yet its existence is unresolved in general. In the setting with few surplus items,…

cs.GT2025

Fraud-Proof Revenue Division on Subscription Platforms

Abheek Ghosh, Tzeh Yuan Neoh, Nicholas Teh +1

We study a model of subscription-based platforms where users pay a fixed fee for unlimited access to content, and creators receive a share of the revenue. Existing approaches to de…

cs.GT2025

Fairness in Repeated Matching: A Maximin Perspective

Eugene Lim, Tzeh Yuan Neoh, Nicholas Teh

We study a sequential decision-making model where a set of items is repeatedly matched to the same set of agents over multiple rounds. The objective is to determine a sequence of m…

cs.GT2025

Not in My Backyard! Temporal Voting Over Public Chores

Edith Elkind, Tzeh Yuan Neoh, Nicholas Teh

We study a temporal voting model where voters have dynamic preferences over a set of public chores -- projects that benefit society, but impose individual costs on those affected b…

cs.GT2025

Approximate Proportionality in Online Fair Division

Davin Choo, Winston Fu, Derek Khu +3

We study the online fair division problem, where indivisible goods arrive sequentially and must be allocated immediately and irrevocably. Prior work establishes strong impossibilit…

cs.GT2025

Online Fair Division with Additional Information

Tzeh Yuan Neoh, Jannik Peters, Nicholas Teh

We study the problem of fairly allocating indivisible goods to agents in an online setting, where goods arrive sequentially and must be allocated irrevocably. Focusing on the popul…

cs.GT2025

Understanding EFX Allocations: Counting and Variants

Tzeh Yuan Neoh, Nicholas Teh

Envy-freeness up to any good (EFX) is a popular and important fairness property in the fair allocation of indivisible goods, of which its existence in general is still an open ques…

cs.CV2025

Neuro Symbolic Knowledge Reasoning for Procedural Video Question Answering

Basura Fernando, Thanh-Son Nguyen, Hong Yang +3

In this work we present Knowledge Module Learning (KML) to understand and reason over procedural tasks that requires models to learn structured and compositional procedural knowled…

cs.DS2024

An Improved Algorithm for Sparse Instances of SAT

Sanjay Jain, Tzeh Yuan Neoh, Frank Stephan

We show that the CNF satisfiability problem (SAT) can be solved in time , where is either the maximum number of occurrences of any variable or the average…

cs.GT2024★ 1 cited

Temporal Fair Division of Indivisible Items

Edith Elkind, Alexander Lam, Mohamad Latifian +2

We study a fair division model where indivisible items arrive sequentially, and must be allocated immediately and irrevocably. Previous work on online fair division has shown impos…

cs.GT2024★ 2 cited

Temporal Elections: Welfare, Strategyproofness, and Proportionality

Edith Elkind, Tzeh Yuan Neoh, Nicholas Teh

We investigate a model of sequential decision-making where a single alternative is chosen at each round. We focus on two objectives -- utilitarian welfare (Util) and egalitarian we…