Natalia Timina and Ivan Melnikov made presentations at the workshop "From the Logical Point of View"
Natalia Timina and Ivan Melnikov, 4th year students of the Higher School of Economics, made presentations on the topic "A Geometric Approach to Epistemic Problems" and "Building a Secure Data Exchange Protocol during the "Russian Card Game"" at the workshop "From the Logical Point of View", which took place on April 19.
Natalia Timina (4th year student of the Higher School of Economics) - "Geometric Approach to Epistemic Problems".
Abstract
In classical problems of dynamic epistemic logic, such as the "Cheryl's Birthday" problem, the initial number of possible worlds is finite. We propose to adapt these kinds of problems by representing the set of possible worlds as a continuous geometric space instead of a set of discrete points. This will allow us to simulate cases when the number of worlds is uncountable. We will consider several variants of the task with different ways of defining impossible "areas".
Ivan Melnikov (4th year student of the Higher School of Economics) - "Building a Secure Data Exchange Protocol during the "Russian Card Game"."
Abstract
The talk is based on the study of the well-known "The Russian Cards Game" problem from the point of view of building a secure data exchange protocol under different circumstances and with different numbers of agents. In what situations can agents exchange knowledge without risking being caught by their opponent? What kind of situations are we going to have to deal with? Is it possible to build an algorithm that will always achieve the desired goal? This particular question and many other questions can be answered with employment of dynamic epistemic logic, although some generalizations are still out of sight.
Natalia Timina (4th year student of the Higher School of Economics) - "Geometric Approach to Epistemic Problems".
Abstract
In classical problems of dynamic epistemic logic, such as the "Cheryl's Birthday" problem, the initial number of possible worlds is finite. We propose to adapt these kinds of problems by representing the set of possible worlds as a continuous geometric space instead of a set of discrete points. This will allow us to simulate cases when the number of worlds is uncountable. We will consider several variants of the task with different ways of defining impossible "areas".
Ivan Melnikov (4th year student of the Higher School of Economics) - "Building a Secure Data Exchange Protocol during the "Russian Card Game"."
Abstract
The talk is based on the study of the well-known "The Russian Cards Game" problem from the point of view of building a secure data exchange protocol under different circumstances and with different numbers of agents. In what situations can agents exchange knowledge without risking being caught by their opponent? What kind of situations are we going to have to deal with? Is it possible to build an algorithm that will always achieve the desired goal? This particular question and many other questions can be answered with employment of dynamic epistemic logic, although some generalizations are still out of sight.
