Given two images, we want to predict which exhibits a particular visual attribute more than
the other---even when the two images are quite similar. Existing relative attribute methods …

Large language models (LLMs) exhibit positional bias in how they use context, which
especially complicates listwise ranking. To address this, we propose permutation self …

How to rank with few errors Page 1 How to Rank with Few Errors A PTAS for Weighted Feedback
Arc Set on Tournaments ∗ Claire Kenyon-Mathieu Warren Schudy † Brown University Computer …

In multiagent settings where the agents have different preferences, preference aggregation
is a central issue. Voting is a general method for preference aggregation, but seminal results …

Computational social choice is an interdisciplinary field of study at the interface of social
choice theory and computer science, promoting an exchange of ideas in both directions. On …

Anomaly detection in time-series has a wide range of practical applications. While numerous
anomaly detection methods have been proposed in the literature, a recent survey concluded …

This paper performs a comparison of several methods for Kemeny rank aggregation (104
algorithms and combinations thereof in total) originating in social choice theory, machine …

Social choice theory concerns the design and formal analysis of methods for aggregating
the preferences of multiple agents. Examples of such methods include voting procedures …

We consider a crowdsourcing database system that may cleanse, populate, or filter its data
by using human workers. Just like a conventional DB system, such a crowdsourcing DB …

1 Her work has been supported in part by an NRW grant for gender-sensitive universities
supporting her as a junior professor for Computational Social Choice and by the project …