Ratip Emin Berker

Orcid: 0000-0003-3394-115X

Affiliations:
  • Carnegie Mellon University, Pittsburgh, USA


According to our database1, Ratip Emin Berker authored at least 15 papers between 2022 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Is Four Enough? Automated Reasoning Approaches and Dual Bounds for Condorcet Dimensions of Elections.
CoRR, April, 2026

How Many Votes is a Lie Worth? Measuring Strategyproofness through Resource Augmentation.
CoRR, February, 2026

Computational Social Choice: Research & Development.
CoRR, February, 2026

On the Edge of Core (Non-)Emptiness: An Automated Reasoning Approach to Approval-Based Multi-Winner Voting.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025
Societal Impact of Computational Social Choice (Dagstuhl Seminar 25401).
Dagstuhl Reports, September, 2025

Designing Rules to Pick a Rule: Aggregation by Consistency.
CoRR, August, 2025

Learning and Computation of Φ-Equilibria at the Frontier of Tractability.
Proceedings of the 26th ACM Conference on Economics and Computation, 2025

From Independence of Clones to Composition Consistency: A Hierarchy of Barriers to Strategic Nomination.
Proceedings of the 26th ACM Conference on Economics and Computation, 2025

Beyond Symmetry in Repeated Games with Restarts.
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

Expected Variational Inequalities.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

The Value of Recall in Extensive-Form Games.
Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

2024
Obvious Independence of Clones - Extended Abstract.
Proceedings of the Artificial Intelligence for Research and Democracy, 2024

Computing Optimal Equilibria in Repeated Games with Restarts.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2022
Quantum and Classical Algorithms for Bounded Distance Decoding.
IACR Cryptol. ePrint Arch., 2022

Obvious Independence of Clones.
CoRR, 2022


  Loading...