109,456 research outputs found
Prohibited Floor Trading Activities Under the Commodity Exchange Act
In algorithmic graph theory, a classic open question is to determine the complexity of the Maximum Independent Set problem on Pt -free graphs, that is, on graphs not containing any induced path on t vertices. So far, polynomial-time algorithms are known only for tâ€5 (Lokshtanov et al., in: Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, OR, USA, January 5â7, 2014, pp 570â581, 2014), and an algorithm for t=6 announced recently (Grzesik et al. in Polynomial-time algorithm for maximum weight independent set on P6 -free graphs. CoRR, arXiv:1707.05491, 2017). Here we study the existence of subexponential-time algorithms for the problem: we show that for any tâ„1 , there is an algorithm for Maximum Independent Set on Pt -free graphs whose running time is subexponential in the number of vertices. Even for the weighted version MWIS, the problem is solvable in 2O(tnlognâ) time on Pt -free graphs. For approximation of MIS in broom-free graphs, a similar time bound is proved. Scattered Set is the generalization of Maximum Independent Set where the vertices of the solution are required to be at distance at least d from each other. We give a complete characterization of those graphs H for which d-Scattered Set on H-free graphs can be solved in time subexponential in the size of the input (that is, in the number of vertices plus the number of edges): If every component of H is a path, then d-Scattered Set on H-free graphs with n vertices and m edges can be solved in time 2O(|V(H)|n+mâlog(n+m)) , even if d is part of the input. Otherwise, assuming the Exponential-Time Hypothesis (ETH), there is no 2o(n+m) -time algorithm for d-Scattered Set for any fixed dâ„3 on H-free graphs with n-vertices and m-edges
Electronic trading on futures exchanges
Although the open outcry method is still the best way to trade highly active contracts on futures exchanges, electronic systems can improve the efficiency and cost effectiveness of trading some types of futures and options. In recent years, the volume of electronic trades on futures exchanges has more than doubled, and it should continue to grow rapidly.Futures
A COMMODITY MARKET SIMULATION GAME FOR TEACHING MARKET RISK MANAGEMENT
The Market Risk Game is a computerized simulation game available for IBM PC and Apple II microcomputers that is designed to give realistic practice in making decisions in a risky market environment. It illustrates the use of hedging and put options to reduce risk in livestock and grain markets. It is best suited for individuals who have a basic understanding of commodity trading, but who need experience to solidify their knowledge to a functional level. Through the game this is done without facing the risk of an actual investment or requiring the time involved in watching a market over an extended period.Risk and Uncertainty,
Characteristics of Real Futures Trading Networks
Futures trading is the core of futures business, and it is considered as one
of the typical complex systems. To investigate the complexity of futures
trading, we employ the analytical method of complex networks. First, we use
real trading records from the Shanghai Futures Exchange to construct futures
trading networks, in which nodes are trading participants, and two nodes have a
common edge if the two corresponding investors appear simultaneously in at
least one trading record as a purchaser and a seller respectively. Then, we
conduct a comprehensive statistical analysis on the constructed futures trading
networks. Empirical results show that the futures trading networks exhibit
features such as scale-free behavior with interesting odd-even-degree
divergence in low-degree regions, small-world effect, hierarchical
organization, power-law betweenness distribution, disassortative mixing, and
shrinkage of both the average path length and the diameter as network size
increases. To the best of our knowledge, this is the first work that uses real
data to study futures trading networks, and we argue that the research results
can shed light on the nature of real futures business.Comment: 18 pages, 9 figures. Final version published in Physica
Institutional developments in the globalization of securities and futures markets
Futures ; International finance
Community preferences for digital futures: regional perspectives
The purpose of the study was to understand community preferences for digital futures in the Southern Downs Region in Queensland, Australia. This study examined the strengths, weaknesses, opportunities and threats of the digital future in the regional context. The methodology applied in this study included three focus group discussions (FGDs) along with a structured questionnaire survey for the participants. Some key suggestions which evolved from the FGDs are that digital services need to be cost-effective and people from low socio-economic backgrounds may require specific supportive measures. A consensus emerged that the provision of this vital digital education needs to be at low or subsidised cost at remote areas. It is therefore important to have a comprehensive understanding of community needs, demands and barriers to adoption to come up with a digital economy strategy for the future. While the FGDs provide an avenue for basic understanding of the broad range of issues at the community level, further micro-level analyses that shed light on the adoption and effects of digital technology on households and businesses are clearly warranted
- âŠ