3 papers
cs.LO2023
Pseudorandom Finite Models
Jan Dreier, Jamie Tucker-Foltz
We study pseudorandomness and pseudorandom generators from the perspective of logical definability. Building on results from ordinary derandomization and finite model theory, we sh…
cs.GT2022
Playing Divide-and-Choose Given Uncertain Preferences
Jamie Tucker-Foltz, Richard Zeckhauser
We study the classic divide-and-choose method for equitably allocating divisible goods between two players who are rational, self-interested Bayesian agents. The players have addit…
cs.LO2021
Inapproximability of Unique Games in Fixed-Point Logic with Counting
Jamie Tucker-Foltz
We study the extent to which it is possible to approximate the optimal value of a Unique Games instance in Fixed-Point Logic with Counting (FPC). Formally, we prove lower bounds ag…