Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jonathan Breitman

dblp:416/0039 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
Databases, data mining, and information retrieval
1 paper
Database theory · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › social choice › computational social choice › multiwinner voting
approval-based committee voting
0.912025
DVote: Constraining Committee Voting with Database Dependencies · Proc. VLDB Endow. 2025
Algorithmic game theory and mechanism design › social choice
committee voting
0.912025
DVote: Constraining Committee Voting with Database Dependencies · Proc. VLDB Endow. 2025
Algorithmic game theory and mechanism design › social choice
computational social choice
0.912025
DVote: Constraining Committee Voting with Database Dependencies · Proc. VLDB Endow. 2025
Database theory
data dependencies
0.312025
DVote: Constraining Committee Voting with Database Dependencies · Proc. VLDB Endow. 2025
Database theory › dependency theory
tuple-generating dependencies
0.312025
DVote: Constraining Committee Voting with Database Dependencies · Proc. VLDB Endow. 2025

Methods — techniques the papers use, named apart from their topics

mixed-integer programming · 0.9mixed integer programming · 0.9
YearPublicationVenuePosition
2025 DVote: Constraining Committee Voting with Database Dependencies
abstract
Approval-Based Committee (ABC) voting refers to the task of selecting a committee of a desired size, given voter preferences that state the specific candidates that each voter approves of. A voting rule aggregates the voter preferences into a winning committee. As a special case, an ABC scoring rule determines a score that each voter contributes to the committee based on her approvals. Various ways have been proposed to impose constraints on the elected committee. The demonstration presents DVote— a tool that implements a recent framework for extending score-based ABC voting with constraints on the context surrounding the candidates, given as a relational database. DVote provides a convenient interface to set up a voting instance and build contextual constraints in the form of Tuple-Generating Dependencies (TGDs) and Denial Constraints (DCs). The computation of the winning committee is done by backend components that encapsulate the contextual database and translate the entire task of constrained election into Mixed Integer Programming. In the demonstration, attendees will experience ABC voting with DVote in different domains and contexts. Companion video available at https://www.youtube.com/watch?v=pgQBm8xRQuU.
Roi Yona, Jonathan Breitman, Benny Kimelfeld
Proc. VLDB Endow.2