Matching games: the least core and the nucleolus

A matching game is a cooperative game defined by a graph $G=(V,E)$. The player set is $V$ and the value of a coalition $S \subseteq V$ is defined as the size of a maximum matching in the subgraph induced by $S$. We show that the nucleolus of such games can be computed efficiently. The result is based on an alternative characterization of the least core which may be of independent interest. The general case of weighted matching games remains unsolved. \u

Deformable vehicle wheel Patent

Resilient vehicle wheel for lunar surface trave

The new FIFA rules are hard: Complexity aspects of sports competitions

Consider a soccer competition among various teams playing against each other in pairs (matches) according to a previously determined schedule. At some stage of the competition one may ask whether a particular team still has a (theoretical) chance to win the competition. The complexity of this question depends on the way scores are allocated according to the outcome of a match. For example, the problem is polynomially solvable for the ancient FIFA rules (2:0 resp. 1:1) but becomes NP-hard if the new rules (3:0 resp. 1:1) are applied. We determine the complexity of the above problem for all possible score allocation rules. \u

The generalized sports competition problem

Consider a sports competition among various teams playing against each other in pairs (matches) according to a previously determined schedule. At some stage of the competition one may ask whether a particular team still has a (theoretical) chance to win the competition. The computational complexity of this question depends on the way scores are allocated according to the outcome of a match. For competitions with at most $3$ different outcomes of a match the complexity is already known. In practice there are many competitions in which more than $3$ outcomes are possible. We determine the complexity of the above problem for competitions with an arbitrary number of different outcomes. Our model also includes competitions that are asymmetric in the sense that away playing teams possibly receive other scores than home playing teams. \u

Shuttle payload bay dynamic environments: Summary and conclusion report for STS flights 1-5 and 9

The vibration, acoustic and low frequency loads data from the first 5 shuttle flights are presented. The engineering analysis of that data is also presented. Vibroacoustic data from STS-9 are also presented because they represent the only data taken on a large payload. Payload dynamic environment predictions developed by the participation of various NASA and industrial centers are presented along with a comparison of analytical loads methodology predictions with flight data, including a brief description of the methodologies employed in developing those predictions for payloads. The review of prediction methodologies illustrates how different centers have approached the problems of developing shuttle dynamic environmental predictions and criteria. Ongoing research activities related to the shuttle dynamic environments are also described. Analytical software recently developed for the prediction of payload acoustic and vibration environments are also described

Manipulating Tournaments in Cup and Round Robin Competitions

In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the most popular types of sporting competitions in polynomial time. In addition, we show that finding the minimal number of games that need to be thrown to manipulate the result can also be determined in polynomial time. Finally, we show that there are several different variations of standard cup competitions where manipulation remains polynomial.Comment: Proceedings of Algorithmic Decision Theory, First International Conference, ADT 2009, Venice, Italy, October 20-23, 200

Magnetic recording head and method of making same Patent

Magnetic recording head composed of ferrite core coated with thin film of aluminum-iron-silicon allo

Effects of simplifying assumptions on optimal trajectory estimation for a high-performance aircraft

When analyzing the performance of an aircraft, certain simplifying assumptions, which decrease the complexity of the problem, can often be made. The degree of accuracy required in the solution may determine the extent to which these simplifying assumptions are incorporated. A complex model may yield more accurate results if it describes the real situation more thoroughly. However, a complex model usually involves more computation time, makes the analysis more difficult, and often requires more information to do the analysis. Therefore, to choose the simplifying assumptions intelligently, it is important to know what effects the assumptions may have on the calculated performance of a vehicle. Several simplifying assumptions are examined, the effects of simplified models to those of the more complex ones are compared, and conclusions are drawn about the impact of these assumptions on flight envelope generation and optimal trajectory calculation. Models which affect an aircraft are analyzed, but the implications of simplifying the model of the aircraft itself are not studied. The examples are atmospheric models, gravitational models, different models for equations of motion, and constraint conditions

Computing the Least-core and Nucleolus for Threshold Cardinality Matching Games

Cooperative games provide a framework for fair and stable profit allocation in multi-agent systems. \emph{Core}, \emph{least-core} and \emph{nucleolus} are such solution concepts that characterize stability of cooperation. In this paper, we study the algorithmic issues on the least-core and nucleolus of threshold cardinality matching games (TCMG). A TCMG is defined on a graph $G=(V,E)$ and a threshold $T$, in which the player set is $V$ and the profit of a coalition $S\subseteq V$ is 1 if the size of a maximum matching in $G[S]$ meets or exceeds $T$, and 0 otherwise. We first show that for a TCMG, the problems of computing least-core value, finding and verifying least-core payoff are all polynomial time solvable. We also provide a general characterization of the least core for a large class of TCMG. Next, based on Gallai-Edmonds Decomposition in matching theory, we give a concise formulation of the nucleolus for a typical case of TCMG which the threshold $T$ equals $1$. When the threshold $T$ is relevant to the input size, we prove that the nucleolus can be obtained in polynomial time in bipartite graphs and graphs with a perfect matching