Drivers of Bank /Branch Switching Intentional Behaviour in Retail Banking: Evidence from Indian Banking Customers

The purpose of this research was to identify and examine the factors that are significant barriers to bank/ branch switching in India from the retail customer’s perspective. The research design was causal cross sectional and primary data was collected using structured questionnaire. The research was conducted between Sep 2018 to Nov 2018.Target population was retail bank customers of nine banks (six nationalized and three private) of India. Sample frame was the bank customers who visited the bank on the days of the study and sample size was 450 (50 customers each bank). The result of the study revealed that eight factors namely Price, Service quality, Switching cost, Reputation of bank, Promotional advertising, Response to service failure, Customer satisfaction, Innovative service product offerings significantly affects switching intention while  Location of bank and Involuntary switching had insignificant effect on switching intention with a predicted switching rate of 24.22%. The model explains 80.6% variation in switching intention. Price, Response to service failure and Innovative service product offerings were three important critical factors for bank switching. Therefore, there is a need for banks to review their bank charges or transaction fees, they must be very responsive to the service failures and should come out with innovative schemes to have a competitive edge. Keywords: Retail banking, customer switching, Price, Service quality, Switching cost, Customer satisfaction. DOI: 10.7176/JMCR/54-01 Publication date:March 31st 201

Simple Wriggling is Hard unless You Are a Fat Hippo

We prove that it is NP-hard to decide whether two points in a polygonal domain with holes can be connected by a wire. This implies that finding any approximation to the shortest path for a long snake amidst polygonal obstacles is NP-hard. On the positive side, we show that snake's problem is "length-tractable": if the snake is "fat", i.e., its length/width ratio is small, the shortest path can be computed in polynomial time.Comment: A shorter version is to be presented at FUN 201

A measure of non-convexity in the plane and the Minkowski sum

In this paper a measure of non-convexity for a simple polygonal region in the plane is introduced. It is proved that for "not far from convex" regions this measure does not decrease under the Minkowski sum operation, and guarantees that the Minkowski sum has no "holes".Comment: 5 figures; Discrete and Computational Geometry, 201