activity
20222026
most citedQuantum and Classical Algorithms for Bounded Distance Decoding

1 citations · 1 across the 14 of their papers we have counts for

collaborators
Showing 2026Show all

7 papers · 1 filter

cs.CL2026

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…

cs.GT2026

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…

cs.GT2026

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…

cs.GT2026

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…

cs.GT2026

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…

cs.GT2026

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…

cs.GT2026

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…