相关论文: Frustration solitaire

The problem of ranking can be described as follows. We have a set of combinatorial objects $S$, such as, say, the k-subsets of n things, and we can imagine that they have been arranged in some list, say lexicographically, and we want to…

Parity games are two-player infinite-duration games on graphs that play a crucial role in various fields of theoretical computer science. Finding efficient algorithms to solve these games in practice is widely acknowledged as a core problem…

Generalized eigenvalue problems involving a singular pencil are very challenging to solve, both with respect to accuracy and efficiency. The existing package Guptri is very elegant but may sometimes be time-demanding, even for small and…

In the paper we compare well known numerical methods of finding PageRank vector. We propose Markov Chain Monte Carlo method and obtain a new estimation for this method. We also propose a new method for PageRank problem based on the…

This article deals with ranking methods. We study the situation where a tournament between $n$ players $P_1$, $P_2$, \ldots $P_n$ gives the ranking $P_1 \succ P_2 \succ \cdots \succ P_n$, but, if the results of $P_n$ are no longer taken…

In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first establish that a class of special rank minimization problems has closed-form solutions. Using this result,…

In recent years, saliency ranking has emerged as a challenging task focusing on assessing the degree of saliency at instance-level. Being subjective, even humans struggle to identify the precise order of all salient instances. Previous…

We study a sorting machine consisting of two stacks in series where the first stack has the added restriction such that entries in the stack must be in decreasing order from top to bottom. We give the basis of the class of permutations that…

The Sliding Window Secretary Problem allows a window of choices to the Classical Secretary Problem, in which there is the option to choose the previous $K$ choices immediately prior to the current choice. We consider a case of this…

We investigate different randomizations for mirror descent method. We try to propose such a randomization that allows us to use sparsity of the problem as much as it possible. In the paper one can also find a generalization of randomizaed…

We propose a new approach to solve the classical Monty Hall problem in its general form. The solution is based on basic tools of probability theory, by defining three elementary events which decompose the sample space into a partition. The…

We study the conditions under which the iterated elimination of strictly dominated strategies is order independent and we identify a class of discontinuous games for which order does not matter. In this way, we answer the open problem…

The main difficulty in solving the discrete constrained problem is its poor and even ill condition. In this paper, we transform the discrete constrained problems on de Rham complex to Laplace-like problems. This transformation not only make…

We analyze properties of apportionment functions in context of the problem of allocating seats in the European Parliament. Necessary and sufficient conditions for apportionment functions are investigated. Some exemplary families of…

We study the submodular secretary problem with a cardinality constraint. In this problem, $n$ candidates for secretaries appear sequentially in random order. At the arrival of each candidate, a decision maker must irrevocably decide whether…

The $n$-th rencontres number with the parameter $r$ is the number of permutations having exactly $r$ fixed points. In particular, a derangement is a permutation without any fixed point. We presents a short combinatorial proof for a weighted…

The orienteering problem is a well-studied and fundamental problem in transportation science. In the problem, we are given a graph with prizes on the nodes and lengths on the edges, together with a budget on the overall tour length. The…

The matching problem plays a basic role in combinatorial optimization and in statistical mechanics. In its stochastic variants, optimization decisions have to be taken given only some probabilistic information about the instance. While the…

The game of best choice (or "secretary problem") is a model for making an irrevocable decision among a fixed number of candidate choices that are presented sequentially in random order, one at a time. Because the classically optimal…

In this paper we study several variations of the \emph{pancake flipping problem}, which is also well known as the problem of \emph{sorting by prefix reversals}. We consider the variations in the sorting process by adding with prefix…