We consider any network environment in which the “best shot game” is played. This is the case where the possible actions are only two for every node (0 and 1), and the best response for a node is 1 if and only if all her neighbors play 0. A natural application of the model is one in which...

The desirability of airport congestion pricing largely depends on whether dominant airlines otherwise fail to internalize their self-imposed congestion delays. Brueckner (2002) and Mayer and Sinai (2003) find (weak) statistically significant evidence of internalization. We replicate and extend...

The technique of Monte Carlo (MC) tests [Dwass (1957), Barnard (1963)] provides an attractive method of building exact tests from statistics whose finite sample distribution is intractable but can be simulated (provided it does not involve nuisance parameters). We extend this method in two ways:...

Panel datasets have been increasingly used in economics to analyse complex economic phenomena. One of the attractions of panel datasets is the ability to use an extended dataset to obtain information about parameters of interest which are assumed to have common values across panel units....

The question of variable selection in a regression model is a major open research topic in econometrics. Traditionally two broad classes of methods have been used. One is sequential testing and the other is information criteria. The advent of large datasets used by institutions such as central...

It is well known that instrumental variables (IV) estimation is sensitive to the choice of instruments both in small samples and asymptotically. Recently, Donald and Newey (2001) suggested a simple method for choosing the instrument set. The method involves minimising the approximate mean square...

Generalised assignment problem (GAP) is a well-known non-deterministic polynomial (NP) hard combinatorial optimisation problem to find the minimum cost during assignment of jobs to agents so that each job is assigned exactly once and agents are not overloaded. In this research, we look at the...

This paper considers two/three-machine no-wait flow shop scheduling problems with makespan minimization. Inherited with the NP-hard problem nature, this scheduling problem is solved by using a Simulated Annealing (SA) and Genetic Algorithm (GA) instead of mathematical programming. These two...