1 citations · 1 across the 14 of their papers we have counts for
17 papers
On the LLM Verification for Argument Graph Generation
Jakub Bąba, Jarosław A. Chudziak
Multi-agent LLM systems can formalize natural-language argumentation end-to-end, turning plain text into structured graphs by classifying components, connecting them with relations…
What You Earn from What You Learn: Characterization and Complexity of the Value of Information
Ratip Emin Berker, Ioannis Anagnostides, Emanuel Tewolde +3
We examine the value of information in extensive-form decision problems: the largest multiplicative gain that a decision maker can obtain from an information refinement, taken over…
Social Choice Foundations for Simulation-Augmented Generation
Sonja Kraiczy, Smitha Milli, Ratip Emin Berker +6
Simulation-augmented generation (SAGE) is a recent technical proposal in which models simulate individuals' viewpoints at inference time in order to provide more representative ans…
Do LLMs Take Care of Their Own? Similarity Signals Can Induce Cooperation
Akash Kundu, Emanuel Tewolde, Ratip Emin Berker +2
As LLM-based agents with user-instructed goals are becoming widely deployed, they increasingly encounter each other in strategic interactions, and face challenges of finding mutual…
MILP the Gap: An Automated Reasoning Approach to Condorcet's Paradox
Itai Zilberstein, Ratip Emin Berker, George Li +1
Computational social choice studies how conflicting individual preferences are aggregated into a collective decision, with applications to elections, AI evaluation/alignment, and r…
Computational Social Choice: Research & Development
Dorothea Baumeister, Ratip Emin Berker, Niclas Boehmer +7
Computational social choice (COMSOC) studies principled ways to aggregate conflicting individual preferences into collective decisions. In this paper, we call for an increased effo…
How Many Votes is a Lie Worth? Measuring Strategyproofness through Resource Augmentation
Ratip Emin Berker, Vincent Conitzer, Eden Hartman +2
It is well known, by the Gibbard-Satterthwaite Theorem, that when there are more than two candidates, any non-dictatorial voting rule can be manipulated by untruthful voters. But h…
On the Edge of Core (Non-)Emptiness: An Automated Reasoning Approach to Approval-Based Multi-Winner Voting
Ratip Emin Berker, Emanuel Tewolde, Vincent Conitzer +3
Core stability is a natural and well-studied notion for group fairness in multi-winner voting, where the task is to select a committee from a pool of candidates. We study the setti…
Designing Rules to Pick a Rule: Aggregation by Consistency
Ratip Emin Berker, Ben Armstrong, Vincent Conitzer +1
Given a set of items and a set of evaluators who all individually rank them, how do we aggregate these evaluations into a single societal ranking? Work in social choice and statist…
Beyond Symmetry in Repeated Games with Restarts
Henry Fleischmann, Kiriaki Fragkia, Ratip Emin Berker
Infinitely repeated games support equilibrium concepts beyond those present in one-shot games (e.g., cooperation in the prisoner's dilemma). Nonetheless, repeated games fail to cap…
Expected Variational Inequalities
Brian Hu Zhang, Ioannis Anagnostides, Emanuel Tewolde +4
Variational inequalities (VIs) encompass many fundamental problems in diverse areas ranging from engineering to economics and machine learning. However, their considerable expressi…
From Independence of Clones to Composition Consistency: A Hierarchy of Barriers to Strategic Nomination
Ratip Emin Berker, Sílvia Casacuberta, Isaac Robinson +3
We study two axioms for social choice functions that capture the impact of similar candidates: independence of clones (IoC) and composition consistency (CC). We clarify the relatio…
Learning and Computation of -Equilibria at the Frontier of Tractability
Brian Hu Zhang, Ioannis Anagnostides, Emanuel Tewolde +4
-equilibria -- and the associated notion of -regret -- are a powerful and flexible framework at the heart of online learning and game theory, whereby enriching the set of dev…
The Value of Recall in Extensive-Form Games
Ratip Emin Berker, Emanuel Tewolde, Ioannis Anagnostides +2
Imperfect-recall games, in which players may forget previously acquired information, have found many practical applications, ranging from game abstractions to team games and testin…
Computing Optimal Equilibria in Repeated Games with Restarts
Ratip Emin Berker, Vincent Conitzer
Infinitely repeated games can support cooperative outcomes that are not equilibria in the one-shot game. The idea is to make sure that any gains from deviating will be offset by re…
Obvious Independence of Clones
Ratip Emin Berker, Sílvia Casacuberta, Christopher Ong +1
The Independence of Clones (IoC) criterion measures a voting rule's robustness to strategic nomination. Prior literature has established empirically that individuals may still subm…
Quantum and Classical Algorithms for Bounded Distance Decoding
Richard Allen, Ratip Emin Berker, Sílvia Casacuberta +1
In this paper, we provide a comprehensive overview of a recent debate over the quantum versus classical solvability of bounded distance decoding (BDD). Specifically, we review the…