Axiomatic Characterization of the Median Function of a Block Graph

Author(s):  
Manoj Changat ◽  
Nella Jeena Jacob ◽  
Prasanth G. Narasimha-Shenoi
2012 ◽  
Vol 04 (04) ◽  
pp. 1250054 ◽  
Author(s):  
KANNAN BALAKRISHNAN ◽  
MANOJ CHANGAT ◽  
HENRY MARTYN MULDER ◽  
AJITHA R. SUBHAMATHI

An antimedian of a profile π = (x1, x2, …, xk) of vertices of a graph G is a vertex maximizing the sum of the distances to the elements of the profile. The antimedian function is defined on the set of all profiles on G and has as output the set of antimedians of a profile. It is a typical location function for finding a location for an obnoxious facility. The 'converse' of the antimedian function is the median function, where the distance sum is minimized. The median function is well studied. For instance it has been characterized axiomatically by three simple axioms on median graphs. The median function behaves nicely on many classes of graphs. In contrast the antimedian function does not have a nice behavior on most classes. So a nice axiomatic characterization may not be expected. In this paper such a characterization is obtained for two classes of graphs on which the antimedian is well behaved: paths and hypercubes.


2015 ◽  
Vol 338 (6) ◽  
pp. 885-894 ◽  
Author(s):  
Kannan Balakrishnan ◽  
Manoj Changat ◽  
Anandavally K. Lakshmikuttyamma ◽  
Joseph Mathew ◽  
Henry Martyn Mulder ◽  
...  

2013 ◽  
Vol 05 (04) ◽  
pp. 1350033 ◽  
Author(s):  
OSCAR ORTEGA ◽  
G. KRISTON

A median of a sequence π = (x1, x2, …, xk) of elements of a finite metric space (X, d) is an element x for which [Formula: see text] is minimum. The function with domain the set of all finite sequences on X and defined by Med(π) = {x | x is a median of π} is called the Median function on X. In this note, an axiomatic characterization of the median function on finite trees is given.


1991 ◽  
Vol 14 (4) ◽  
pp. 477-491
Author(s):  
Waldemar Korczynski

In this paper an algebraic characterization of a class of Petri nets is given. The nets are characterized by a kind of algebras, which can be considered as a generalization of the concept of the case graph of a (marked) Petri net.


2004 ◽  
Vol 47 (3) ◽  
pp. 261-273 ◽  
Author(s):  
Dipjyoti Majumdar

2014 ◽  
Vol 129 (3) ◽  
pp. 1449-1499 ◽  
Author(s):  
José Luis Montiel Olea ◽  
Tomasz Strzalecki

Abstract This article provides an axiomatic characterization of quasi-hyperbolic discounting and a more general class of semi-hyperbolic preferences. We impose consistency restrictions directly on the intertemporal trade-offs by relying on what we call “annuity compensations.” Our axiomatization leads naturally to an experimental design that disentangles discounting from the elasticity of intertemporal substitution. In a pilot experiment we use the partial identification approach to estimate bounds for the distributions of discount factors in the subject pool. Consistent with previous studies, we find evidence for both present and future bias.


2009 ◽  
Vol 30 (5) ◽  
pp. 1172-1185 ◽  
Author(s):  
Henry Martyn Mulder ◽  
Ladislav Nebeský

Sign in / Sign up

Export Citation Format

Share Document