4 papers
Explaining Rankings with Hidden Group Bonuses
Alvin Hong Yao Yan, Suraj Shetiya, Sujoy Bhore +2
Determining a linear utility function that correlates with observed candidate rankings is a foundational problem with applications in domains such as admissions, hiring, and recomm…
Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience
Michael Yiqing Hu, Alvin Hong Yao Yan, Jialin Li
Byzantine Reliable Broadcast (BRB) is a fundamental primitive in distributed computing and cryptographic systems; reducing the communication cost of BRB thus remains an important r…
Fairness in Aggregation: Optimal Top- and Improved Full Ranking
Diptarka Chakraborty, Arya Mazumdar, Barna Saha +1
Ensuring fairness in algorithmic ranking systems is a critical challenge with significant societal implications for hiring, recommendations, web search, and data management. Standa…
Lemonshark: Asynchronous DAG-BFT With Early Finality
Michael Yiqing Hu, Alvin Hong Yao Yan, Yang Yihan +2
DAG-Rider popularized a new paradigm of DAG-BFT protocols, separating dissemination from consensus: all nodes disseminate transactions as blocks that reference previously known blo…