Publications

Sampling Balanced Forests of Grids in Polynomial Time.Sarah Cannon, Wesley Pegden, and Jamie Tucker-Foltz. ACM Symposium on Theory of Computing, June 2024. ►Abstract [ PDF ] [ arXiv ] |
STOC 2024 | ||

School Redistricting: Wiping Unfairness Off the Map.Ariel D. Procaccia, Isaac Robinson, and Jamie Tucker-Foltz. ACM-SIAM Symposium on Discrete Algorithms, January 2024. ►Abstract [ PDF ] [ 25 minute SODA talk ] |
SODA 2024 | ||

Playing Divide-and-Choose Given Uncertain Preferences.Jamie Tucker-Foltz and Richard Zeckhauser. Management Science, January 2024. 24th ACM Conference on Economics and Computation, July 2023. ►Abstract [ PDF ] [ arXiv ] |
Mgmt Sci EC 2023 | ||

You Can Have Your Cake and Redistrict It Too.Gerdus Benadè, Ariel D. Procaccia, and Jamie Tucker-Foltz. 24th ACM Conference on Economics and Computation, July 2023. ►Abstract [ PDF ] [ arXiv ] |
EC 2023 | ||

Pseudorandom Finite Models.Jan Dreier and Jamie Tucker-Foltz. 38th Annual Symposium on Logic in Computer Science, June 2023. ►Abstract [ PDF ] [ arXiv ] |
LICS 2023 | ||

Topological Universality of the Art Gallery Problem.Jack Stade and Jamie Tucker-Foltz. 39th International Symposium on Computational Geometry, June 2023. ►Abstract [ PDF ] [ arXiv ] |
SoCG 2023 | ||

Representation with Incomplete Votes.Daniel Halpern, Gregory Kehne, Ariel D. Procaccia, Jamie Tucker-Foltz, and Manuel Wüthrich. 37th AAAI Conference on Artificial Intelligence, February 2023. ►Abstract [ PDF ] [ arXiv ] |
AAAI 2023 | ||

Thou Shalt Covet The Average Of Thy Neighbors' Cakes.Jamie Tucker-Foltz. Information Processing Letters, November 2022. ►Abstract [ PDF ] [ arXiv ] [ Official journal version ] |
IPL | ||

Can Buyers Reveal for a Better Deal?Daniel Halpern, Gregory Kehne, and Jamie Tucker-Foltz. 31st International Joint Conference on Artificial Intelligence, July 2022. ►Abstract [ PDF ] [ arXiv ] |
IJCAI 2022 | ||

Compact Redistricting Plans Have Many Spanning Trees.Ariel D. Procaccia and Jamie Tucker-Foltz. ACM-SIAM Symposium on Discrete Algorithms, January 2022. ►Abstract [ PDF ] [ arXiv ] [ 20 minute SODA talk ] [ 60 minute talk at Copenhagen-Jerusalem Combinatorics Seminar ] |
SODA 2022 | ||

Inapproximability of Unique Games in Fixed-Point Logic with Counting.Jamie Tucker-Foltz. Logical Methods in Computer Science, 2024. 36th Annual Symposium on Logic in Computer Science, July 2021. ★ Best student paper ►Abstract [ PDF ] [ arXiv ] [ LICS paper ] [ 15 minute LICS talk ] [ 60 minute talk at UMass CS Theory Seminar ] |
LMCS LICS 2021 | ||

Multiagent Evaluation Mechanisms.Tal Alon, Magdalen Dobson, Ariel D. Procaccia, Inbal Talgam-Cohen, and Jamie Tucker-Foltz. 6th World Congress of the Game Theory Society, July 2021. 34th AAAI Conference on Artificial Intelligence, February 2020. ►Abstract [ PDF ] [ Download AAAI paper ] [ 20 minute GAMES talk ] |
GAMES 2021 AAAI 2020 | ||

A Cut And Choose Mechanism to Prevent Gerrymandering.Jamie Tucker-Foltz. 29th International Conference on Game Theory, July 2018. ►Abstract [ PDF ] [ arXiv ] |
Stony Brook 2018 | ||

Computational Topology and the Unique Games Conjecture.Joshua A. Grochow and Jamie Tucker-Foltz. 34th International Symposium on Computational Geometry, June 2018. ►Abstract [ PDF ] [ Download SoCG paper ] [ arXiv ] |
SoCG 2018 | ||

Witness Complexes for Time Series Analysis.Nicole Sanderson, Jamie Tucker-Foltz, Elizabeth Bradley, and James D. Meiss. SIAM Conference on Applications of Dynamical Systems (workshop), May 2017. ►Abstract [ Download slides ] [ 20 minute talk by Nicole Sanderson ] |
DS 2017 | ||