Optimal Impartial Correspondences

by   Javier Cembrano, et al.

We study mechanisms that select a subset of the vertex set of a directed graph in order to maximize the minimum indegree of any selected vertex, subject to an impartiality constraint that the selection of a particular vertex is independent of the outgoing edges of that vertex. For graphs with maximum outdegree d, we give a mechanism that selects at most d+1 vertices and only selects vertices whose indegree is at least the maximum indegree in the graph minus one. We then show that this is best possible in the sense that no impartial mechanism can only select vertices with maximum degree, even without any restriction on the number of selected vertices. We finally obtain the following trade-off between the maximum number of vertices selected and the minimum indegree of any selected vertex: when selecting at most k vertices out of n, it is possible to only select vertices whose indegree is at least the maximum indegree minus ⌊(n-2)/(k-1)⌋+1.


page 1

page 2

page 3

page 4


Reconfiguring colourings of graphs with bounded maximum average degree

The reconfiguration graph R_k(G) of the k-colourings of a graph G has as...

Robot Subset Selection for Swarm Lifetime Maximization in Computation Offloading with Correlated Data Sources

Consider robot swarm wireless networks where mobile robots offload their...

The Sea Exploration Problem: Data-driven Orienteering on a Continuous Surface

This paper describes a problem arising in sea exploration, where the aim...

Incentive-Compatible Kidney Exchange in a Slightly Semi-Random Model

Motivated by kidney exchange, we study the following mechanism-design pr...

Neighbourhood Evaluation Criteria for Vertex Cover Problem

Neighbourhood Evaluation Criteria is a heuristical approximate algorithm...

Preferential Attachment Graphs with Planted Communities

A variation of the preferential attachment random graph model of Barabás...

Probabilistic Properties of GIG Digraphs

We study the probabilistic properties of the Greatest Increase Grid (GIG...

Please sign up or login with your details

Forgot password? Click here to reset