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

Mateusz Szwagierczak

dblp:439/0856 · 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

Artificial intelligence and machine learning · 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%

Topics — the 3 heaviest of 3, 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
Strategic Cost Selection in Participatory Budgeting · NeurIPS 2025
Algorithmic game theory and mechanism design › solution concepts in games › equilibrium concepts
nash equilibrium existence
0.912025
Strategic Cost Selection in Participatory Budgeting · NeurIPS 2025
Algorithmic game theory and mechanism design › social choice
participatory budgeting
0.912025
Strategic Cost Selection in Participatory Budgeting · NeurIPS 2025

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

game theory · 0.9experimental study · 0.9
YearPublicationVenuePosition
2025 Strategic Cost Selection in Participatory Budgeting
abstract
We study strategic behavior of project proposers in the context of approval-based participatory budgeting (PB). In our model we assume that the votes are fixed and known and the proposers want to set as high project prices as possible, provided that their projects get selected and the prices are not below the minimum costs of their delivery. We study the existence of pure Nash equilibria (NE) in such games, focusing on the AV/Cost, Phragmen, and Method of Equal Shares rules. We also provide an experimental study of cost selection on real-life PB election data.
Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk 0001, Grzegorz Lisowski, Piotr Skowron 0001, Stanislaw Szufa, Mateusz Szwagierczak
NeurIPS7