Related papers: Classifying Permutations under Context-Directed Sw…
The special purpose sorting operation, context directed swap (CDS), is an example of the block interchange sorting operation studied in prior work on permutation sorting. CDS has been postulated to model certain molecular sorting events…
Permutation sorting, one of the fundamental steps in pre-processing data for the efficient application of other algorithms, has a long history in mathematical research literature and has numerous applications. Two special-purpose sorting…
Prior studies of the efficiency of the block interchange (swap) and the reversal sorting operations on (signed) permutations identified specialized versions of the these operations. These specialized operations are here called context…
The study of sorting permutations by block interchanges has recently been stimulated by a phenomenon observed in the genome maintenance of certain ciliate species. The result was the identification of a block interchange operation that…
In multiplayer games with sequential decision-making, self-interested players form dynamic coalitions to achieve most-preferred temporal goals beyond their individual capabilities. We introduce a novel procedure to synthesize strategies…
Inspired by a common technique for shuffling a deck of cards on a table without riffling, we formalize the pile shuffle and investigate its capabilities as a sorting device. Our study is novel in that we consider pile shuffle in three…
The game of best choice (also known as the secretary problem) is a model for sequential decision making with a long history and many variations. The classical setup assumes that the sequence of candidate rankings are uniformly distributed.…
We consider game-theoretically secure distributed protocols for coalition games that approximate the Shapley value with small multiplicative error. Since all known existing approximation algorithms for the Shapley value are randomized, it…
We study the emergency of mutual cooperation in evolutionary prisoner's dilemma games when the players are located on a square lattice. The players can choose one of the three strategies: cooperation (C), defection (D) or "tit for tat" (T),…
A simplified prisoner's game is studied on a square lattice when the players interacting with their neighbors can follow only two strategies: to cooperate (C) or to defect (D) unconditionally. The players updated in a random sequence have a…
We study a modified prisoner's dilemma game taking place on two-dimensional disordered square lattices. The players are pure strategists and can either cooperate or defect with their immediate neighbors. In the generations each player…
We introduce a game on graphs. By a theorem of Zermelo, each instance of the game on a finite graph is determined. While the general decision problem on which player has a winning strategy in a given instance of the game is unsolved, we…
Evolutionary game theory studies populations that change in response to an underlying game. Often, the functional form relating outcome to player attributes or strategy is complex, preventing mathematical progress. In this work, we…
This study optimises manually derived rule-based expert system classification of objects according to changes in their properties over time. One of the key challenges that this study tries to address is how to classify objects that exhibit…
Knockout tournaments, also known as single-elimination or cup tournaments, are a popular form of sports competitions. In the standard probabilistic setting, for each pairing of players, one of the players wins the game with a certain (a…
Simple stochastic games are two-player zero-sum stochastic games with turn-based moves, perfect information, and reachability winning conditions. We present two new algorithms computing the values of simple stochastic games. Both of them…
We consider dynamic cooperative games, where the worth of coalitions varies over time according to the history of allocations. When defining the core of a dynamic game, we allow the possibility for coalitions to deviate at any time and…
Assume that a treasure is placed in one of $M$ boxes according to a known distribution and that $k$ searchers are searching for it in parallel during $T$ rounds. We study the question of how to incentivize selfish players so that the…
Sampling permutations from S_n is a fundamental problem from probability theory. The nearest neighbor transposition chain \cal{M}}_{nn} is known to converge in time \Theta(n^3 \log n) in the uniform case and time \Theta(n^2) in the constant…
The prisoner's dilemma (PD) game is a simple model for understanding cooperative patterns in complex systems consisting of selfish individuals. Here, we study a PD game problem in scale-free networks containing hierarchically organized…