 |
Anaëlle Wilczynski
|
|
Department of Informatics (I18)
Technical University of Munich
|
|
|
| E-Mail: |
This email address is being protected from spambots. You need JavaScript enabled to view it. |
| Office: |
Room 01.10.039
Boltzmannstr. 3
85748 Garching, Germany
|
| Phone: |
+49 (0) 89 289 - 17514 |
| Hours: |
by arrangement |
|
|
Short Bio
Since February 2019, I am a postdoc researcher in Computational Social Choice at Technische Universität München within the team of Prof. Dr. Felix Brandt.
I obtained my PhD in Computer Science in December 2018 at Université Paris-Dauphine. My PhD thesis, supervised by Laurent Gourvès and Julien Lesca, deals with strategic voting and resource allocation problems where the possibility of interaction among agents is represented by a graph.
Keywords: Artificial Intelligence, Computational Social Choice, Algorithmic Game Theory, Voting, Fair Division, Social Network
Program Committees
PC member: AAAI (2020), IJCAI (2020), RJCIA (2020)
Sub-reviewer: AAAI (2018), AAMAS (2018, 2019), EC (2019), IJCAI (2018), MFCS (2020), SAGT (2019, 2020)
Reviewer in journals: Social Choice and Welfare, Theory and Decision, Autonomous Agents and Multi-Agent Systems, Artificial Intelligence
Publications
F. Brandt, M. Bullinger, and A. Wilczynski.
Reaching individually stable coalition structures in hedonic
games.
In
Proceedings of the 35th AAAI Conference on Artificial
Intelligence (AAAI), 2021.
Forthcoming.
[
pdf |
venue ]
F. Brandt, M. Bullinger, and A. Wilczynski.
Reaching individually stable coalition structures in hedonic
games.
2021.
Working paper.
[
pdf ]
F. Brandt and A. Wilczynski.
On the convergence of swap dynamics to Pareto-optimal
matchings.
2020.
Working paper.
[
pdf ]
D. Baumeister, A.-K. Selker, and A. Wilczynski.
Manipulation of opinion polls to influence iterative elections.
In
Proceedings of the 19th International Conference on
Autonomous Agents and Multiagent Systems (AAMAS), pages 132–140, 2020.
[
link ]
F. Brandt and A. Wilczynski.
On the convergence of swap dynamics to Pareto-optimal
matchings.
In
Proceedings of the 15th International Conference on Web and
Internet Economics (WINE), Lecture Notes in Computer Science (LNCS), pages
100–113. Springer-Verlag, 2019.
[
link |
pdf |
venue ]
A. Beynier, Y. Chevaleyre, L. Gourvès, A. Harutyunyan, J. Lesca, N. Maudet,
and A. Wilczynski.
Local envy-freeness in house allocation problems.
Autonomous Agents and Multi-Agent Systems, 33(5):591–627,
2019.
[
link ]
A. Wilczynski.
Poll-confident voters in iterative voting.
In
Proceedings of the 33rd AAAI Conference on Artificial
Intelligence (AAAI), pages 2205–2212, 2019.
[
link ]
A. Beynier, Y. Chevaleyre, L. Gourvès, J. Lesca, N. Maudet, and
A. Wilczynski.
Local envy-freeness in house allocation problems.
In
Proceedings of the 17th International Conference on
Autonomous Agents and Multiagent Systems (AAMAS), pages 292–300, 2018.
[
link ]
A. Saffidine and A. Wilczynski.
Constrained swap dynamics over a social network in distributed
resource reallocation.
In
Proceedings of the 11th International Symposium on
Algorithmic Game Theory (SAGT), volume 11059 of
Lecture Notes in
Computer Science (LNCS), pages 213–225. Springer-Verlag, 2018.
[
link |
pdf ]
L. Gourvès, J. Lesca, and A. Wilczynski.
Object allocation via swaps along a social network.
In
Proceedings of the 26th International Joint Conference on
Artificial Intelligence (IJCAI), pages 213–219, 2017.
[
link ]
L. Gourvès, J. Lesca, and A. Wilczynski.
Strategic voting in a social context: Considerate equilibria.
In
Proceedings of the 22nd European Conference on Artificial
Intelligence (ECAI), pages 1423–1431, 2016.
[
link |
pdf ]
Thesis
Anaëlle Wilczynski. Interaction among Agents via a Social Network in Computational Social Choice, PSL, Université Paris-Dauphine, December 2018. [ pdf ]
