New algorithms for matching problems

A preprint with Jacky Lo, just submitted to arXiv and on my publications page. The paper was ultimately inspired by a Christmas party game, which shows that the line between work and play is hard to draw. Abstract: The standard two-sided and one-sided matching problems, and the closely related school choice problem, have been widely […]

A blockage cleared

After a very long time, some (revised versions of) papers have emerged, two on distance rationalizability of voting rules with Benjamin Hadjibeyli, one on signed networks with Samin Aref, and one on “wisdom of crowds” with Patrick Girard and Valery Pavlov. There is a long list of things still to do, but this is a […]

Asymptotics of lattice paths

Stephen Melczer and I have just posted a paper to arXiv.org: Asymptotics of lattice walks via analytic combinatorics in several variables. In my humble opinion this is a nontrivial advance in the area. It is a nice application of smooth and multiple point asymptotics in the framework developed by Robin Pemantle and me.

Measures of partial balance in signed networks

Networks in which the edges can be positive or negative occur in many applications (for example, in international relations, states may be allied or official enemies). A widely-used theory of “balance” predicts that networks should become more balanced over time. However there are no clearly agreed measures of partial balance. Samin Aref and I made […]

Distance-based voting rules

After a long gestation period in which I seemed to be publishing nothing, a few projects have reached maturity. With Benjamin Hadjibeyli, I have a preprint studying so-called distance rationalizable voting rules, which we recently submitted. These are voting rules in which we specify some notion of consensus winner, set up a distance measure on […]