Secretary problem: graphs, matroids and greedoids

01/02/2018
by   Wojciech Kordecki, et al.
0

In the paper the generalisation of the well known "secretary problem" is considered. The aim of the paper is to give a generalised model in such a way that the chosen set of the possible best k elements have to be independent of all rejected elements. This condition is formulated using the theory of greedoids and in their special cases -- matroids and antimatroids. Examples of some special cases of greedoids (uniform, graphical matroids and binary trees) are considered.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/11/2019

Independent Domination in Directed Graphs

In this paper we initialize the study of independent domination in direc...
research
07/03/2023

Improved sampling via learned diffusions

Recently, a series of papers proposed deep learning-based approaches to ...
research
07/04/2012

Structured Region Graphs: Morphing EP into GBP

GBP and EP are two successful algorithms for approximate probabilistic i...
research
03/24/2022

A more flexible counterpart of a Huang-Kotz's copula-type

We propose a more flexible symmetric counterpart of the Huang-Kotz's cop...
research
05/03/2023

Experimental Design for Any p-Norm

We consider a general p-norm objective for experimental design problems ...
research
01/31/2022

The road problem and homomorphisms of directed graphs

We make progress on a generalization of the road (colouring) problem. Th...
research
03/08/2019

Complexity of packing common bases in matroids

One of the most intriguing unsolved questions of matroid optimization is...

Please sign up or login with your details

Forgot password? Click here to reset