相关论文: Combinatorial Solutions Providing Improved Securit…
Secure communication protocols are becoming increasingly important, e.g. for internet-based communication. Quantum key distribution allows two parties, commonly called Alice and Bob, to generate a secret sequence of 0s and 1s called a key…
Consider the problem: Alice wishes to send the same key to $n-1$ users (Bob, Carol,. . . , Nathan), while preventing eavesdropper Eve from acquiring information without being detected. The problem has no solution in the classical…
The aim of this work is to put together two novel concepts from the theory of integrable billiards: billiard ordered games and confocal billiard books. Billiard books appeared recently in the work of Fomenko's school, in particular of V.…
We study balanced solutions for network bargaining games with general capacities, where agents can participate in a fixed but arbitrary number of contracts. We provide the first polynomial time algorithm for computing balanced solutions for…
Alice communicates with words drawn uniformly amongst $\{\ket{j}\}_{j=1..n}$, the canonical orthonormal basis. Sometimes however Alice interleaves quantum decoys $\{\frac{\ket{j}+i\ket{k}}{\sqrt{2}}\}$ between her messages. Such pairwise…
A transmitter Alice may wish to reliably transmit a message to a receiver Bob over a binary symmetric channel (BSC), while simultaneously ensuring that her transmission is deniable from an eavesdropper Willie. That is, if Willie listening…
This paper investigates the popular card game UNO from the viewpoint of algorithmic combinatorial game theory. We define simple and concise mathematical models for the game, including both cooperative and uncooperative versions, and analyze…
Wireless secret sharing is crucial to information security in the era of Internet of Things. One method is to utilize the effect of the randomness of the wireless channel in the data link layer to generate the common secret between two…
In this Paper, we investigate the security of Zhang, Li and Guo quantum key distribution via quantum encryption protocol [$\text{Phys. Rev. A} \textbf{64}, 24302 (2001)$] and show that it is not secure against some of Eve's attacks and with…
Cybersecurity is an important topic which is often viewed as one that is inaccessible due to steep learning curves and a perceived requirement of needing specialist knowledge. With a constantly changing threat landscape, practical solutions…
We introduce a combinatorial variant of the cost sharing problem: several services can be provided to each player and each player values every combination of services differently. A publicly known cost function specifies the cost of…
Finding the clique of maximum cardinality in an arbitrary graph is an NP-Hard problem that has many applications, which has motivated studies to solve it exactly despite its difficulty. The great majority of algorithms proposed in the…
The main ambition of this thesis is to contribute to the development of cooperative game theory towards combinatorics, algorithmics and discrete geometry. Therefore, the first chapter of this manuscript is devoted to highlighting the…
This paper studies a single-suit version of the card game War on a finite deck of cards. There are varying methods of how players put the cards that they win back into their hands, but we primarily consider randomly putting the cards back…
A game is played by a team of two --- say Alice and Bob --- in which the value of a random variable $x$ is revealed to Alice only, who cannot freely communicate with Bob. Instead, she is given a quantum $n$-level system, respectively a…
To reduce the danger of powerful super-intelligent AIs, we might make the first such AIs oracles that can only send and receive messages. This paper proposes a possibly practical means of using machine learning to create two classes of…
This paper provides a complexity analysis for the game of reconnaissance blind chess (RBC), a recently-introduced variant of chess where each player does not know the positions of the opponent's pieces a priori but may reveal a subset of…
We analyse two party non-local games whose predicate requires Alice and Bob to generate matching bits, and their three party extensions where a third player receives all inputs and is required to output a bit that matches that of the…
We examine the following version of a classic combinatorial search problem introduced by R\'enyi: Given a finite set $X$ of $n$ elements we want to identify an unknown subset $Y \subset X$ of exactly $d$ elements by testing, by as few as…
The stochastic multi-armed bandit model captures the tradeoff between exploration and exploitation. We study the effects of competition and cooperation on this tradeoff. Suppose there are $k$ arms and two players, Alice and Bob. In every…