A proof of first-order stochastic dominance for quantity constrained oligopolies

In this paper a proof for First Order Stochastic Dominance for capacity constrained oligopolies exhibiting equilibrium in mixed strategies is derived. The result is an extension of Levitan and Shubik (1972) where they derive the mixed strategy equilibrium for quantity constrained oligopolies. I show that their result has applications in policy issues in Regulation and Trade Theory. The proof of First Order Stochastic Dominance facilitates the comparison of expected prices across different experimental/trade policy designs, enlarging the qualitative implications of the results derived by Levitan et al

Quantitative restrictions in experimental posted-offer markets

The effect of imposing binding and non-binding quantity restrictions upon price convergence in posted-offer markets is discussed. Unlike in the price control experiments prices do not jump after the removal of quantity restrictions. Further, a surprising property of prices was observed in these experiments, prices converge from below the competitive equilibrium. This result contradicted the well established empirical regularity that price convergence is from above the competitive equilibrium in Posted-Offer markets. Thus, the asymmetric distribution of surplus, or the imposition of quotas themselves affected price convergence in the quota experiments

Small Vertex Cover makes Petri Net Coverability and Boundedness Easier

The coverability and boundedness problems for Petri nets are known to be Expspace-complete. Given a Petri net, we associate a graph with it. With the vertex cover number k of this graph and the maximum arc weight W as parameters, we show that coverability and boundedness are in ParaPspace. This means that these problems can be solved in space O(ef(k,W)poly(n)), where ef(k,W) is some exponential function and poly(n) is some polynomial in the size of the input. We then extend the ParaPspace result to model checking a logic that can express some generalizations of coverability and boundedness.Comment: Full version of the paper appearing in IPEC 201

Online Circular Calendar

A calendar is a system to organize days for social, commercial or administrative purpose. Many calendar systems are available today. The calendar system helps the user in scheduling his/her events or tasks over a time period. This period may be an hour, a day, or even months. Due to increase in user’s activities, events that need to be scheduled in the calendar grow tremendously. Moreover, there are events that occur every year which require a good visualization for mental manipulation. As a result there is a difficulty in organizing these events in the current calendar system. The main idea of this project is to provide a calendar system in which users can organize the events easily, and to close the gap between the actual software and the mental model of the users. None of the current calendar systems have the ability to manipulate and plot graphs throughout the year. The data is user dependent and can be of any sort like temperature, rainfall, stock analysis etc., Apart from this; good visualization techniques can be used for the calendar system to make the events apparent to the users. By this way user can view the overall picture of the events and will have clear idea about their events. This paper describes the implementation of such a calendar system with good visualization

Foucault precession manifested in a simple system

This article aims to answer the question, "What is the simplest system that embodies the essence of Foucault's pendulum?" We study a very elementary idealized system that exhibits a precession behavior analogous to the classic pendulum. The system consists of a particle without inertial mass, constrained to an inclined plane that rotates about a vertical axis. Insights gained from this analysis are used to understand the rate of precession in a straightforward way