# data[].attributes.body
ad antelope. Similarly, the second lion tires over fighting, and becomes the third lion's prey. The third lion may thus attack and kill the second lion in order to recover from it the dead antelope, tiring itself in the process. And so it continues. None of the lions is suicidal and prefers to remain hungry than be dead. If not killed by the successive lion, the tired lion gets to eat the antelope instead, and couldn't be more satisfied. Question: when does the first lion kill the antelope?
There are countably
There are countably many wrapped christmas presents in front of you. You can select one. If you guess correctly what the present is, you can keep it. Before making your guess, you are allowed to open as many of the other presents as you want. Can you come up with a guess that guarantees that you will almost surely keep the present?

more_vert
You need to carry ou
You need to carry out a fair random draw between two options, but your only coin is biased. What can you do? 
Consider a n by n ch
Consider a n by n checkerboard. At date 0, you can choose to place presents on any squares you want, so that each square contains either 0 or 1 present. At date 1, Santa will add a present in all empty squares that have at least two non-empty

# data[].attributes.body
Count the number of partitions of {1,...,N} such that every partition element is of the form {m,...,n}, i.e., has no wholes.

# data[].attributes.body
A rectangle is a Sentez rectangle if two (or four) of its sides are whole multiples of a metre in length.

A rectangle R is covered by a finite number of (non-overlapping) tiles, each tile being a Sentez rectangle.  Show that R, too, is a Sentez rectangle.

# data[].attributes.body
You have a (large) piece of paper with two crosses on it. Using only a pair of compasses (you have no ruler), find their exact midpoint by drawing seven circles.

# data[].attributes.headline
At Gatwick Airport there a shuttle train to take you to the North Terminal, from where my flight to Edinburgh leaves.  The shuttle runs every 5 minutes.

# data[].attributes.subject
At Gatwick Airport there a shuttle train to take you to the North Terminal, from where my flight to Edinburgh leaves.  The shuttle runs every 5 minutes.

# data[].attributes.body
I am late arriving into the airport and have: first to walk to the Shuttle: then wait for the Shittle to depart for the North Terminal; finally walk to the departure area.

Because I am unfit, I can only run (as opposed
to walk) for a single short spurt of time.  Should I run before or after the Shuttle?

# data[].attributes.headline
Exploratory Matching (suggested to me by a friend)

# data[].attributes.subject
Exploratory Matching (suggested to me by a friend)

# data[].attributes.body
There are N individuals that seek to pairwise match with one another. Individuals are ranked from 1 to N. Sadly, none of the individuals knows their own rank, but observes everyone else’s rank. Endowed with an infinite amount of time and only concerned with match outcomes—matching with k+1 is unanimously preferred over matching with k over matching with none—propose a matching algorithm whereby pairs (N,N-1),(N-1,N-2),… match with one another.

# data[].attributes.body
There are two doctors and three shifts, called Monday, Tuesday, and Wednesday, in short M,T,W. Each shift requires the presence of exactly one doctor and, out of fairness, each doctor works at least one shift. Finally, working an additional shift contributes to a doctor's unhappiness (so that M is preferred over both MT and MW but not necessarily over TW). Both doctors know each others' preferences over shifts (no indifferences).

1. Does there exist a Nash implementable SCR which is non-dictatorial according to which doctor 1 works M,T, or W and doctor 2 works TW,MW,MT? Hint: apply a famous theorem.

2. Propose a non-dictatorial SCR and the (sequential) mechanism that implements it. Hint: divide and choose.

# data[].attributes.body
There are N hungry lions and an antelope. The first lion is well positioned to attack and kill the antelope, tiring itself in the process. A tired first lion is the second lion's prey, who may attack and kill the first lion in order to recover from it the dead antelope. Similarly, the second lion tires over fighting, and becomes the third lion's prey. The third lion may thus attack and kill the second lion in order to recover from it the dead antelope, tiring itself in the process. And so it continues. None of the lions is suicidal and prefers to remain hungry than be dead. If not killed by the successive lion, the tired lion gets to eat the antelope instead, and couldn't be more satisfied. Question: when does the first lion kill the antelope?

# data[].attributes.body
There are countably many wrapped christmas presents in front of you. You can select one. If you guess correctly what the present is, you can keep it. Before making your guess, you are allowed to open as many of the other presents as you want. Can you come up with a guess that guarantees that you will almost surely keep the present?

# data[].attributes.body
You need to carry out a fair random draw between two options, but your only coin is biased. What can you do?

# data[].attributes.body
Consider a n by n checkerboard. At date 0, you can choose to place presents on any squares you want, so that each square contains either 0 or 1 present. At date 1, Santa will add a present in all empty squares that have at least two non-empty neighbours, and repeat this process at dates 2, 3, and so on. What is the minimum number of presents you need to place initially to guarantee that all squares will eventually contain a present? (Note: two squares are neighbours if they have a common side. Thus a given square has two, three or four neighbours, depending on its location on the board).