activity
20122022
most citedSolving Cooperative Reliability Games

24 citations · 77 across the 5 of their papers we have counts for

collaborators

13 papers

cs.MA2025

To Stand on the Shoulders of Giants: Should We Protect Initial Discoveries in Multi-Agent Exploration?

Hodaya Lampert, Reshef Meir, Kinneret Teodorescu

Exploring new ideas is a fundamental aspect of research and development (R\&D), which often occurs in competitive environments. Most ideas are subsequent, i.e. one idea today leads…

cs.GT2024

Distribution Aggregation via Continuous Thiele's Rules

Jonathan Wagner, Reshef Meir

We introduce the class of \textit{Continuous Thiele's Rules} that generalize the familiar \textbf{Thiele's rules} \cite{janson2018phragmens} of multi-winner voting to distribution…

cs.GT2024

Condorcet's Jury Theorem with Abstention

Ganesh Ghalme, Reshef Meir

The well-known Condorcet's Jury theorem posits that the majority rule selects the best alternative among two available options with probability one, as the population size increase…

cs.HC20241 cited

Efficient Online Crowdsourcing with Complex Annotations

Reshef Meir, Viet-An Nguyen, Xu Chen +2

Crowdsourcing platforms use various truth discovery algorithms to aggregate annotations from multiple labelers. In an online setting, however, the main challenge is to decide wheth…

cs.GT2023

Strategic Proxy Voting on the Line

Gili Bielous, Reshef Meir

This paper offers a framework for the study of strategic behavior in proxy voting, where non-active voters delegate their votes to active voters. We further study how proxy voting…

cs.GT2023

Strategy-proof Budgeting via a VCG-like Mechanism

Jonathan Wagner, Reshef Meir

We present a strategy-proof public goods budgeting mechanism where agents determine both the total volume of expanses and the specific allocation. It is constructed as a modificati…