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

Ancsa Hannak

dblp:369/7071 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—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%
Artificial intelligence
1 paper
Trustworthy machine learning · 100%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › market design
matching markets
0.712023
Strategic Behavior in Two-sided Matching Markets with Prediction-enhanced Preference-formation · NeurIPS 2023
Algorithmic game theory and mechanism design
strategic behavior
0.712023
Strategic Behavior in Two-sided Matching Markets with Prediction-enhanced Preference-formation · NeurIPS 2023
Algorithmic game theory and mechanism design › market design › matching markets
two-sided matching
0.712023
Strategic Behavior in Two-sided Matching Markets with Prediction-enhanced Preference-formation · NeurIPS 2023
Machine learning › Trustworthy machine learning
robustness
0.212023
Strategic Behavior in Two-sided Matching Markets with Prediction-enhanced Preference-formation · NeurIPS 2023
YearPublicationVenuePosition
2023 Strategic Behavior in Two-sided Matching Markets with Prediction-enhanced Preference-formation
abstract
Two-sided matching markets have long existed to pair agents in the absence of regulated exchanges. A common example is school choice, where a matching mechanism uses student and school preferences to assign students to schools. In such settings, forming preferences is both difficult and critical. Prior work has suggested various prediction mechanisms that help agents make decisions about their preferences. Although often deployed together, these matching and prediction mechanisms are almost always analyzed separately. The present work shows that at the intersection of the two lies a previously unexplored type of strategic behavior: agents returning to the market (e.g., schools) can attack future predictions by interacting short-term non-optimally with their matches. Here, we first introduce this type of strategic behavior, which we call an adversarial interaction attack. Next, we construct a formal economic model that captures the feedback loop between prediction mechanisms designed to assist agents and the matching mechanism used to pair them. Finally, in a simplified setting, we prove that returning agents can benefit from using adversarial interaction attacks and gain progressively more as the trust in and accuracy of predictions increases. We also show that this attack increases inequality in the student population.
Stefania Ionescu, Kenneth Joseph, Ancsa Hannak
NeurIPS4