Morse matchings on polytopes

We show how to construct homology bases for certain CW complexes in terms of discrete Morse theory and cellular homology. We apply this technique to study certain subcomplexes of the half cube polytope studied in previous works. This involves constructing explicit complete acyclic Morse matchings on the face lattice of the half cube; this procedure may be of independent interest for other highly symmetric polytopes

Retail Marketing in Rural India – Factors in Favour and Strategies

Retail industry now accounting for 10% of the country’s GDP undergoes dynamic changes boosting its growth still further. The sector grows impressively leading to production of wide range of products and services. Rural markets provide great scope for marketers due to increased revenue and purchase power of the rural population in India. The rural income is expected to increase faster due to government policies supporting agriculture and the earning population that has temporarily moved out of rural villages to cities for employment in non-agricultural sectors. Technology in agriculture has helped to produce quality crops and the market is ready to give high prices for such products. Around 60% of the students in the colleges are first generation graduates who have moved out of their villages for tertiary education. Thus the life style, likes and preferences of the rural population keeps changing. However the huge rural segment is much different from that of the urban segment and the marketers need to approach with sustained efforts and special models. The highly fragmented rural segment’s needs are majorly filled by unorganized family run Kirana stores and Maligai shops. The share of organised retail in the country has risen by 60% and the same is expected to have impact on the rural market as well. The paper focuses on the growth of retail market in India, the emerging factors in favour of rural retail and suggests strategies for rural retailing

From Batch to Transductive Online Learning

It is well-known that everything that is learnable in the difficult online setting, where an arbitrary sequences of examples must be labeled one at a time, is also learnable in the batch setting, where examples are drawn independently from a distribution. We show a result in the opposite direction. We give an efficient conversion algorithm from batch to online that is transductive: it uses future unlabeled data. This demonstrates the equivalence between what is properly and efficiently learnable in a batch model and a transductive online model

Efficiency of Truthful and Symmetric Mechanisms in One-sided Matching

We study the efficiency (in terms of social welfare) of truthful and symmetric mechanisms in one-sided matching problems with {\em dichotomous preferences} and {\em normalized von Neumann-Morgenstern preferences}. We are particularly interested in the well-known {\em Random Serial Dictatorship} mechanism. For dichotomous preferences, we first show that truthful, symmetric and optimal mechanisms exist if intractable mechanisms are allowed. We then provide a connection to online bipartite matching. Using this connection, it is possible to design truthful, symmetric and tractable mechanisms that extract 0.69 of the maximum social welfare, which works under assumption that agents are not adversarial. Without this assumption, we show that Random Serial Dictatorship always returns an assignment in which the expected social welfare is at least a third of the maximum social welfare. For normalized von Neumann-Morgenstern preferences, we show that Random Serial Dictatorship always returns an assignment in which the expected social welfare is at least \frac{1}{e}\frac{\nu(\opt)^2}{n}, where \nu(\opt) is the maximum social welfare and $n$ is the number of both agents and items. On the hardness side, we show that no truthful mechanism can achieve a social welfare better than \frac{\nu(\opt)^2}{n}.Comment: 13 pages, 1 figur

The Least-core and Nucleolus of Path Cooperative Games

Cooperative games provide an appropriate framework for fair and stable profit distribution in multiagent systems. In this paper, we study the algorithmic issues on path cooperative games that arise from the situations where some commodity flows through a network. In these games, a coalition of edges or vertices is successful if it enables a path from the source to the sink in the network, and lose otherwise. Based on dual theory of linear programming and the relationship with flow games, we provide the characterizations on the CS-core, least-core and nucleolus of path cooperative games. Furthermore, we show that the least-core and nucleolus are polynomially solvable for path cooperative games defined on both directed and undirected network

Alterations in tumour suppressor gene p53 in human gliomas from Indian patients

Alterations in the tumour suppressor p53 gene are among the most common defects seen in a variety of human cancers. In order to study the significance of the p53 gene in the genesis and development of human glioma from Indian patients, we checked 44 untreated primary gliomas for mutations in exons 5-9 of the p53 gene by PCR-SSCP and DNA sequencing. Sequencing analysis revealed six missense mutations. The incidence of p53 mutations was 13.6% (6 of 44). All the six mutations were found to be located in the central core domain of p53, which carries the sequence-specific DNA-binding domain. These results suggest a rather low incidence but a definite involvement of p53 mutations in the gliomas of Indian patients

Reconstructing a Simple Polytope from its Graph

Blind and Mani (1987) proved that the entire combinatorial structure (the vertex-facet incidences) of a simple convex polytope is determined by its abstract graph. Their proof is not constructive. Kalai (1988) found a short, elegant, and algorithmic proof of that result. However, his algorithm has always exponential running time. We show that the problem to reconstruct the vertex-facet incidences of a simple polytope P from its graph can be formulated as a combinatorial optimization problem that is strongly dual to the problem of finding an abstract objective function on P (i.e., a shelling order of the facets of the dual polytope of P). Thereby, we derive polynomial certificates for both the vertex-facet incidences as well as for the abstract objective functions in terms of the graph of P. The paper is a variation on joint work with Michael Joswig and Friederike Koerner (2001).Comment: 14 page

Covering Problems for Partial Words and for Indeterminate Strings

We consider the problem of computing a shortest solid cover of an indeterminate string. An indeterminate string may contain non-solid symbols, each of which specifies a subset of the alphabet that could be present at the corresponding position. We also consider covering partial words, which are a special case of indeterminate strings where each non-solid symbol is a don't care symbol. We prove that indeterminate string covering problem and partial word covering problem are NP-complete for binary alphabet and show that both problems are fixed-parameter tractable with respect to $k$, the number of non-solid symbols. For the indeterminate string covering problem we obtain a $2^{O(k \log k)} + n k^{O(1)}$-time algorithm. For the partial word covering problem we obtain a $2^{O(\sqrt{k}\log k)} + nk^{O(1)}$-time algorithm. We prove that, unless the Exponential Time Hypothesis is false, no $2^{o(\sqrt{k})} n^{O(1)}$-time solution exists for either problem, which shows that our algorithm for this case is close to optimal. We also present an algorithm for both problems which is feasible in practice.Comment: full version (simplified and corrected); preliminary version appeared at ISAAC 2014; 14 pages, 4 figure

Can we Rationally Learn to Coordinate?

In this paper we examine the issue whether individual rationality considerations are sufficient to guarantee that individuals will learn to coordinate. This question is central in any discussion of whether social phenomena (read: conventions) can be explained in terms of a purely individualistic approach. We argue that the positive answers to this general question that have been obtained in some recent work require assumptions which incorporate some convention. This conclusion may be seen as supporting the viewpoint of institutional individualism in contrast to psychological individualism