There is disparity in access to Information and Communication Technologies between male and female especially in developing countries. This study did a gender analysis of access and use of ICTs in Ekiti state, Nigeria. Multistage sampling procedure was used to select 178 respondents. Data collected were analysed using descriptive statistics and t-test at α0.05. Radio (198.7), mobile phones (186...

In two-sided and coalition matching games, agents must all agree for a match to be formed, and agents can make only a finite number of matches. I examine the nonparametric identification and estimation of match production functions in matching games with endogenous prices and transferable utility. Inequalities derived from necessary conditions for equilibrium underly a nonparametric maximum sco...

Generalized stationary points of the mathematical program with equilibrium constraints (MPEC) are studied to better describe the limit points produced by interior point methods for MPEC. A primal-dual interior-point method is then proposed, which solves a sequence of relaxed barrier problems derived from MPEC. Global convergence results are deduced without assuming strict complementarity or the...

Puget’s article “On the Satisfiability of Symmetrical Constraint Satisfaction Problems” [Puget, 1993] is widely acknowledged to be one of the founding papers in symmetry breaking (see for example [Flener et al., 2006; Rossi et al., 2006; Walsh, 2006]). To date, Puget’s definition of a valid reduction seems to be the only common ground that all authors on static symmetry breaking constraints agr...

Given a graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of a graph is the sum of the powers of its nodes. Motivated by applications in wireless networks, we consider several fundamental undirected network design problems under the power minimization criteria. The Minimum-Power Edge-Cover (MPEC) problem is: given a graph G = (V, E) with edge co...

We introduce the study of Conditional symmetry breaking in constraint programming. This arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Conditional symmetry can cause redundancy in a systematic search for solutions. Breaking this symmetry is an important part of solving a constraint satisfaction ...

We propose two algorithms for deciding if the Walrasian equilibrium inequalities are solvable. These algorithms may serve as nonparametric tests for multiple calibration of applied general equilibrium models or they can be used to compute counterfactual equilibria in applied general equilibrium models defined by the Walrasian equilibrium inequalities.

We consider a class of quadratic programs with linear complementarity constraints (QPLCC) which belong to mathematical programs with equilibrium constraints (MPEC). We investigate various stationary conditions and present new and strong necessary and sufficient conditions for global and local optimality. Furthermore, we propose a Newton-like method to find an M-stationary point in finite steps ...

An edge-coloring of a graph G = (V,E) is a function c that assigns an integer c(e) (called color) in {0, 1, 2, . . . } to every edge e ∈ E so that adjacent edges receive different colors. An edge-coloring is compact if the colors of the edges incident to every vertex form a set of consecutive integers. The minimum deficiency problem is to determine the minimum number of pendant edges that must ...