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 […]

COMSOC 2016

I attended this biennial meeting for the fourth consecutive time. Attendance in Toulouse was substantially larger than previously. Organization was excellently led by Umberto Grandi. Toulouse was busy with tourists augmented by fans of Euro 2016 football teams and evenings were very noisy downtown. The city seems like a pleasant, slightly provincial place. There were […]

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.

Predicting the 2015 Canadian election

The Canadian general election will be held on 19 October. The most basic prediction method uses the full district (“riding”) vote information from the last election (in 2011), the current poll estimate for national level support for each party, and a model of changes in district votes. There are two main models used in predicting […]

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 […]

Experimental research

When I was a PhD student, stretching my horizons meant thinking about commutative ring theory, instead of general rings. Over my career I have gradually stretched further, taking in mathematical parts of computer science and social choice theory. However in recent years the stretching has become much larger. In addition to supervising PhD students in […]

Canadam 2015

Last week I made a flying visit to Canada for this annual meeting (it’s hard to imagine any other type given the distance, but it was particularly short – less than 72 hours in the country). I was invited by Steve Melczer, an impressive PhD student who seems to have read my coauthored book better […]