Games of No Chance MSRI Publications (2008)
Richman Games, Andrew J. Lazarus, Daniel E. Loeb, James G. Propp, Daniel Ullman
Abstract. A Richman game is a combinatorial game in which, rather than alternating moves, the two players bid for the privilege of making the next move. We find optimal strategies for both the case...
In search of Robbins stability (2004)
Kedlaya, Kiran S., Propp, James G.
We speculate on whether a certain p-adic stability phenomenon, observed by David Robbins empirically for Dodgson condensation, appears in other nonlinear recurrence relations that "unexpectedly"...
Kenyon, Richard W., Propp, James G., Wilson, David B.
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to...
Richard W. Kenyon, James G. Propp, David B. Wilson
In this article, Temperley's bijection between spanning trees in the square grid and perfect matchings (also known as dimer coverings) of the square grid is generalized to the setting of general...
Richard W. Kenyon, James G. Propp, David B. Wilson
In this article, Temperley's bijection between spanning trees in the square grid and perfect matchings (also known as dimer coverings) of the square grid is generalized to the setting of general...
Lazarus, Andrew J., Loeb, Daniel E., Propp, James G., Ullman, Daniel
A Richman game is a combinatorial game in which, rather than alternating moves, the two players bid for the privilege of making the next move. We consider both the case where the players pay each...
Combinatorial Games under Auction Play
Lazarus, Andrew J., Loeb, Daniel E., Propp, James G., Stromquist, Walter R., Ullman, Daniel H.
Richard W. Kenyon, James G. Propp, David B. Wilson
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is...
Richard W. Kenyon, James G. Propp, David B. Wilson
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is...