735 research outputs found
Economic Development in China and Its Implications for East Asia
No full textEconomic development in China, East Asia, trade adjustment
Toward Win-Win Regionalism in Asia: Issues and Challenges in Forming Efficient Trade Agreements
No full textMany economists tend to be skeptical of the merits of Free-Trade Areas (FTAs) due to their second-best nature, while others support them under certain conditions, particularly as they allow for a more comprehensive treatment of trade- and investment-related issues than is currently possible under the 149-member WTO. This paper endeavors to bridge this analytical chasm by developing a blueprint for âÂÂfirst-bestâ regionalism based on âÂÂbest practices.â It then applies the associated set of rules to existing FTAs in Asia (both intra- and extra-regional) to guage the degree to which they approach best practices. In summary, we find that most accords receive high marks in most areas, with the exception of âÂÂrules of originâ and certain service sectors.Asian integration; free trade agreement; best practices; Asian development
3-Factor-criticality in domination critical graphs
No full textAbstractA graph G is said to be k-γ-critical if the size of any minimum dominating set of vertices is k, but if any edge is added to G the resulting graph can be dominated with k-1 vertices. The structure of k-γ-critical graphs remains far from completely understood when k⩾3.A graph G is factor-critical if G-v has a perfect matching for every vertex v∈V(G) and is bicritical if G-u-v has a perfect matching for every pair of distinct vertices u,v∈V(G). More generally, a graph is said to be k-factor-critical if G-S has a perfect matching for every set S of k vertices in G. In three previous papers [N. Ananchuen, M.D. Plummer, Some results related to the toughness of 3-domination-critical graphs, Discrete Math. 272 (2003) 5–15; N. Ananchuen, M.D. Plummer, Matching properties in domination critical graphs, Discrete Math. 277 (2004) 1–13; N. Ananchuen, M.D. Plummer, Some results related to the toughness of 3-domination-critical graphs. II. Utilitas Math. 70 (2006) 11–32], we explored the toughness of 3-γ-critical graphs and some of their matching properties. In particular, we obtained some properties which are sufficient for a 3-γ-critical graph to be factor-critical and, respectively, bicritical. In the present work, we obtain similar results for k-factor-critical graphs when k=3
The ASEAN Economic Community and the European Experience
No full textIn November 2002, the Association of Southeast Asian Nations (ASEAN) committed itself to the creation of an ASEAN Economic Community (AEC), in which goods, services, capital, and skilled labor would flow freely by the year 2020, or possibly even 2015. Hence, the AEC will guide the ASEAN integration agenda for at least the medium-term. The object of this paper is to analyze the lessons (both positive and negative) for the AEC that might be gleaned from the European Union (EU)Â economic integration experience. The paper notes that while there is much that the EU experience can teach ASEAN, the region should not underestimate the substantive differences between the two regions or their differing historical contexts . Based on this analysis, the paper also suggests various approaches to the creation of the AEC that ASEAN might consider as it concretizes the AEC program.ASEAN economic integration; ASEAN Economic Community; EU integration and developing countries
EU-Asia Free Trade Areas? Economic and Policy Considerations
No full textThis paper analyzes key aspects of the changing economic relationship between the European Union (EU) and Asia, and explores the potential economic ramifications of deeper EU-Asian economic cooperation. The author investigates the possible costs to the EU of remaining “disengaged” from the Asian integration process and the likely impact of multi-nested EU-Asian trade agreements. His empirical review of CGE models revealed trivial effects of several possible EU-Asian accords (e.g., EU-India, EU-ASEAN, EU-Republic of Korea). In part, this is a result of relatively small trade shares, open markets, and restrictions in the models, particularly in that they excluded behind-the-border effects. He also presents two CGE models that estimate the potential negative effects of Asian/Asia-Pacific regional accords on the EU, and likewise found small effects. Nevertheless, using a highly-disaggregated (partial-equilibrium) approach, he argues that high-quality FTAs in Asia could be quite detrimental to the EU, particularly in key sectors. The push toward a Free Trade Area of the Asia Pacific could be particularly worrisome to the EU. It is therefore concluded that it makes sense for the EU to be more aggressive in pursuing prospective trade agreements with Asia.asia eu economic cooperation; asia eu trade; free trade areas
Matching properties in connected domination critical graphs
No full textAbstractA dominating set of vertices S of a graph G is connected if the subgraph G[S] is connected. Let γc(G) denote the size of any smallest connected dominating set in G. A graph G is k-γ-connected-critical if γc(G)=k, but if any edge e∈E(G¯) is added to G, then γc(G+e)⩽k-1. This is a variation on the earlier concept of criticality of edge addition with respect to ordinary domination where a graph G was defined to be k-critical if the domination number of G is k, but if any edge is added to G, the domination number falls to k-1.A graph G is factor-critical if G-v has a perfect matching for every vertex v∈V(G), bicritical if G-u-v has a perfect matching for every pair of distinct vertices u,v∈V(G) or, more generally, k-factor-critical if, for every set S⊆V(G) with |S|=k, the graph G-S contains a perfect matching. In two previous papers [N. Ananchuen, M.D. Plummer, Matching properties in domination critical graphs, Discrete Math. 277 (2004) 1–13; N. Ananchuen, M.D. Plummer, 3-factor-criticality in domination critical graphs, Discrete Math. 2007, to appear [3].] on ordinary (i.e., not necessarily connected) domination, the first and third authors showed that under certain assumptions regarding connectivity and minimum degree, a critical graph G with (ordinary) domination number 3 will be factor-critical (if |V(G)| is odd), bicritical (if |V(G)| is even) or 3-factor-critical (again if |V(G)| is odd). Analogous theorems for connected domination are presented here. Although domination and connected domination are similar in some ways, we will point out some interesting differences between our new results for the case of connected domination and the results in [N. Ananchuen, M.D. Plummer, Matching properties in domination critical graphs, Discrete Math. 277 (2004) 1–13; N. Ananchuen, M.D. Plummer, 3-factor-criticality in domination critical graphs, Discrete Math. 2007, to appear [3].]
Inequality and Growth Revisited
No full textThis paper updates and extends the work of Barro (2000). International data confirm the presence of the Kuznets curve-an inverse-U shape relationship between income inequality and per capita GDP-that is relatively stable from the 1960s into the 2000s. The direct effect of international openness on income inequality is also found to be positive. On the other hand, a cross-country-growth equation shows a negative effect of income inequality on economic growth, holding fixed a familiar set of other explanatory variables. This effect diminishes as per capita GDP rises and may be positive for the richest countries.inequality; growth; Kuznets curve; Gini coefficient
Restricted matching in graphs of small genus
No full textAbstractA graph G with at least 2n+2 vertices is said to be n-extendable if every set of n disjoint edges in G extends to (i.e., is a subset of) a perfect matching. More generally, a graph is said to have property E(m,n) if, for every matching M of size m and every matching N of size n in G such that M∩N=0̸, there is a perfect matching F in G such that M⊆F, but F∩N=0̸. G is said to have property E(0,0) if it has a perfect matching. The study of the properties E(m,n) is referred to as the study of restricted matching extension.In [M. Porteous, R. Aldred, Matching extensions with prescribed and forbidden edges, Australas. J. Combin. 13 (1996) 163–174; M. Porteous, Generalizing matching extensions, M.A. Thesis, University of Otago, 1995; A. McGregor-Macdonald, The E(m,n) property, M.Sc. Thesis, University of Otago, 2000], Porteous and Aldred, Porteous and McGregor-Macdonald, respectively, studied the possible implications among the properties E(m,n) for various values of m and n. In an earlier paper [R.E.L. Aldred, Michael D. Plummer, On restricted matching extension in planar graphs, in: 17th British Combinatorial Conference (Canterbury 1999), Discrete Math. 231 (2001) 73–79], the present authors completely determined which of the various properties E(m,n) always hold, sometimes hold and never hold for graphs embedded in the plane. In the present paper, we do the same for embeddings in the projective plane, the torus and the Klein bottle
How (and why) the United States should help to build the ASEAN economic community
No full textFor more about the East-West Center, see http://www.eastwestcenter.org/Michael Plummer leads this issue of East-West Dialogue with a call for ambitious new initiatives leading to a U.S.-ASEAN economic space and a U.S.-ASEAN partnership fund to deepen civic and cultural ties. Plummer is joined by other expert commentators who agree the relationship is vital and offer further suggestions, confirming that gains from a deeper partnership are mutual and that the region is receptive to U.S. initiatives. Commentaries: ASEAN-U.S. Cooperation in Building the ASEAN Economic Community by Scot A. Marciel, Deputy Assistant Secretary for Southeast Asia and Ambassador for ASEAN Affairs; The American-ASEAN Relationship by Kishore Mahbubani, Dean, Lee Kuan Yew School of Public Policy, National University of Singapore and former Ambassador to the United Nations from Singapore; Revitalizing ASEAN Competitiveness by Chalongphob Sussangkarn, Minister of Finance of Thailand (2007) and President, Thailand Development Research Institute (1996-2007). East-West Dialogue, a project of the East-West Center, fosters discussion and debate of key issues in Asia-U.S. economic relations. The Dialogue seeks to develop and promote innovative policy, business, and civic initiatives to enhance this critical partnership. What do YOU think? Join the Dialogue on this issue's discussion page, where you can leave a comment and read comments from others
On restricted matching extension in planar graphs
No full textAbstractLet G be a connected graph with at least 2(m+n+1) vertices. Then G is E(m,n) if for each pair of disjoint matchings M,N⊆E(G) of size m and n, respectively, there exists a perfect matching F in G such that M⊆F and F∩N=∅. In the present paper, we wish to study the property E(m,n) for the various values of integers m and n when the graphs in question are restricted to be planar. It is known (Plummer, Annals of Discrete Mathematics 41 (1989) 347–354) that no planar graph is E(3,0). This result is improved in the present paper by showing that no planar graph is E(2,1). This severely limits the values of m and n for which a planar graph can have property E(m,n) and leads us to consider the properties E(1,n) and E(0,n) for certain classes of planar graphs. Sharpness of the various results is also explored
- …
