Recent Comments

Recent Posts
 Second third of my ICM 2018 paper – Three Puzzles on Mathematics, Computation and Games. Corrections and comments welcome
 First third of my ICM2018 paper – Three Puzzles on Mathematics, Computation and Games. Corrections and comments welcome
 Preview: The solution by Keller and Lifshitz to several open problems in extremal combinatorics
 Basic Notions Seminar is Back! Helly Type Theorems and the Cascade Conjecture
 My Very First Book “Gina Says”, Now Published by “World Scientific”
 Itai Benjamini: Coarse Uniformization and Percolation & A Paper by Itai and me in Honor of Lucio Russo
 AfterDinner Speech for Alex Lubotzky
 Boaz Barak: The different forms of quantum computing skepticism
 Bálint Virág: Random matrices for Russ
Top Posts & Pages
 Second third of my ICM 2018 paper  Three Puzzles on Mathematics, Computation and Games. Corrections and comments welcome
 First third of my ICM2018 paper  Three Puzzles on Mathematics, Computation and Games. Corrections and comments welcome
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 Preview: The solution by Keller and Lifshitz to several open problems in extremal combinatorics
 Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
 A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
 TYI 30: Expected number of Dice throws
 Basic Notions Seminar is Back! Helly Type Theorems and the Cascade Conjecture
 If Quantum Computers are not Possible Why are Classical Computers Possible?
RSS
Category Archives: Games
Test Your Intuition (19): The Advantage of the Proposers in the Stable Matching Algorithm
Stable mariage The GaleShapley stable matching theorem and the algorithm. GALESHAPLEY THEOREM Consider a society of n men and n women and suppose that every man [and every woman] have a preference (linear) relation on the women [men] he [she] knows. Then … Continue reading
Test Your Intuition (17): What does it Take to Win TicTacToe
(A few more quantum posts are coming. But let’s have a quick break for games.) Tic Tac Toe is played since anciant times. For the common version, where the two players X and O take turns in marking the empty squares … Continue reading
Ann Lehman’s Sculpture Based on Herb Scarf’s Maximal Lattice Free Convex Bodies
Maximal latticefree convex bodies introduced by Herb Scarf and the related complex of maximal lattice free simplices (also known as the Scarf complex) are remarkable geometric constructions with deep connections to combinatorics, convex geometry, integer programming, game theory, fixed point computations, … Continue reading
Posted in Art, Computer Science and Optimization, Economics, Games
Tagged Ann Lehman, Herb Scarf
3 Comments
Angry Bird Skepticism
Lenore Holditch is a freelance writer. Here is what she wrote to me: “I love learning about new topics, so I am confident that I can provide valuable content for your blog on any topic you wish, else I can … Continue reading
The Privacy Paradox of Rann Smorodinsky
The following paradox was raised by Rann Smorodinsky: Rann Smorodinsky’s Privacy Paradox Suppose that you have the following onetime scenario. You want to buy a sandwich where the options are a roast beef sandwich or an avocado sandwich. Choosing … Continue reading
Eyal Sulganik: Towards a Theory of “Mathematical Accounting”
The following post was kindly contributed by Eyal Sulganik from IDC (Interdiciplinary Center) Herzliya. Eyal was motivated by our poll on certainty “beyond a reasonable doubt,” which is related to several issues in accounting. Mathematicians, I believe, are always looking … Continue reading
Galvin’s Proof of Dinitz’s Conjecture
Dinitz’ conjecture The following theorem was conjectured by Jeff Dinitz in 1979 and proved by Fred Galvin in 1994: Theorem: Consider an n by n square table such that in each cell (i,j) you have a set with n or more elements. … Continue reading
Posted in Combinatorics, Games
6 Comments
Another way to Revolutionize Football
The angle of Victoria Beckham’s hat (here in a picture from a recent wedding) is closely related to our previous post on football One of the highlights of the recent Newton Institute conference on discrete harmonic analysis was a football … Continue reading
Is Backgammon in P?
The Complexity of ZeroSum Stochastic Games with Perfect Information Is there a polynomial time algorithm for chess? Well, if we consider the complexity of chess in terms of the board size then it is fair to think that the answer is … Continue reading
Subexponential Lower Bound for Randomized Pivot Rules!
Oliver Friedmann, Thomas Dueholm Hansen, and Uri Zwick have managed to prove subexponential lower bounds of the form for the following two basic randomized pivot rules for the simplex algorithm! This is the first result of its kind and deciding … Continue reading