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

Narges Ahani

dblp:293/9968 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author · 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 · 60% Mathematical optimization · 40%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design
market design
0.512021
Dynamic Placement in Refugee Resettlement · EC 2021
Algorithmic game theory and mechanism design › market design
matching markets
0.512021
Dynamic Placement in Refugee Resettlement · EC 2021
Algorithmic game theory and mechanism design › matching
refugee resettlement
0.512021
Dynamic Placement in Refugee Resettlement · EC 2021
Mathematical optimization › stochastic optimization
stochastic programming
0.512021
Dynamic Placement in Refugee Resettlement · EC 2021
Mathematical optimization › stochastic optimization › stochastic programming
two-stage stochastic programming
0.512021
Dynamic Placement in Refugee Resettlement · EC 2021

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

stochastic programming · 0.5dynamic allocation · 0.5
YearPublicationVenuePosition
2021 Dynamic Placement in Refugee Resettlement
abstract
Employment outcomes of resettled refugees depend strongly on where they are placed inside the host country. While the United States sets refugee capacities for communities on an annual basis, refugees arrive and must be placed over the course of the year. We introduce a dynamic allocation system based on two-stage stochastic programming to improve employment outcomes. Our algorithm is able to achieve over 98 percent of the hindsight-optimal employment compared to under 90 percent of current greedy-like approaches. This dramatic improvement persists even when we incorporate a vast array of practical features of the refugee resettlement process including indivisible families, batching, and uncertainty with respect to the number of future arrivals. Our algorithm is now part of the Annie™? MOORE optimization software used by a leading American refugee resettlement agency. The full version of this paper is available at https://arxiv.org/pdf/2105.14388.pdf.
Narges Ahani, Paul Gölz, Ariel D. Procaccia, Alexander Teytelboym, Andrew C. Trapp
EC1