8 citations · 9 across the 4 of their papers we have counts for
4 papers
Two statements of the Duggan-Schwartz theorem
Egor Ianovski
The Duggan-Schwartz theorem (Duggan and Schwartz, 1992) is a famous result concerning strategy-proof social choice correspondences, often stated as "A social choice correspondence…
DValue for Boolean games is EXP-complete
Egor Ianovski
We show that the following problem is EXP-complete: given a rational v and a two player, zero-sum Boolean game G determine whether the value of G is at least v. The proof is via a…
Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures
Alwen Tiu, Egor Ianovski, Rajeev Gore
A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calcu…
Cake Cutting Mechanisms
Egor Ianovski
We examine the history of cake cutting mechanisms and discuss the efficiency of their allocations. In the case of piecewise uniform preferences, we define a game that in the presen…