A small nitpicky practicality comment: in a real world system you can’t allow infinitely divisible votes. You have to choose a large finite number of divisions per vote (e.g. 1e15). If a user can input infinitely small divisions, then they can crash the vote storage system with irrational numbers (e.g. pi).
I am no longer a gifted analyst, but I seriously doubt this. Differential games are well known, with their marvelous fixed point theorems and all the stuff.
In fact, if votes are not divisible you have to lot them, , as you can see in the (clumsy but tractable) discrete version I have analyzed in the paper.
A small nitpicky practicality comment: in a real world system you can’t allow infinitely divisible votes. You have to choose a large finite number of divisions per vote (e.g. 1e15). If a user can input infinitely small divisions, then they can crash the vote storage system with irrational numbers (e.g. pi).
I am no longer a gifted analyst, but I seriously doubt this. Differential games are well known, with their marvelous fixed point theorems and all the stuff.
In fact, if votes are not divisible you have to lot them, , as you can see in the (clumsy but tractable) discrete version I have analyzed in the paper.