Stable Marriage with Multi-Modal Preferences

We introduce a generalized version of the famous Stable Marriage problem, now based on multi-modal preference lists. The central twist herein is to allow each agent to rank its potentially matching counterparts based on more than one "evaluation mode" (e.g., more than one criterion); thus, each agent is equipped with multiple preference lists, each ranking the counterparts in a possibly different way. We introduce and study three natural concepts of stability, investigate their mutual relations and focus on computational complexity aspects with respect to computing stable matchings in these new scenarios. Mostly encountering computational hardness (NP-hardness), we can also spot few islands of tractability and make a surprising connection to the \textsc{Graph Isomorphism} problem

Approximability of Connected Factors

Finding a d-regular spanning subgraph (or d-factor) of a graph is easy by Tutte's reduction to the matching problem. By the same reduction, it is easy to find a minimal or maximal d-factor of a graph. However, if we require that the d-factor is connected, these problems become NP-hard - finding a minimal connected 2-factor is just the traveling salesman problem (TSP). Given a complete graph with edge weights that satisfy the triangle inequality, we consider the problem of finding a minimal connected $d$-factor. We give a 3-approximation for all $d$ and improve this to an (r+1)-approximation for even d, where r is the approximation ratio of the TSP. This yields a 2.5-approximation for even d. The same algorithm yields an (r+1)-approximation for the directed version of the problem, where r is the approximation ratio of the asymmetric TSP. We also show that none of these minimization problems can be approximated better than the corresponding TSP. Finally, for the decision problem of deciding whether a given graph contains a connected d-factor, we extend known hardness results.Comment: To appear in the proceedings of WAOA 201

A Survey on Approximation Mechanism Design without Money for Facility Games

In a facility game one or more facilities are placed in a metric space to serve a set of selfish agents whose addresses are their private information. In a classical facility game, each agent wants to be as close to a facility as possible, and the cost of an agent can be defined as the distance between her location and the closest facility. In an obnoxious facility game, each agent wants to be far away from all facilities, and her utility is the distance from her location to the facility set. The objective of each agent is to minimize her cost or maximize her utility. An agent may lie if, by doing so, more benefit can be obtained. We are interested in social choice mechanisms that do not utilize payments. The game designer aims at a mechanism that is strategy-proof, in the sense that any agent cannot benefit by misreporting her address, or, even better, group strategy-proof, in the sense that any coalition of agents cannot all benefit by lying. Meanwhile, it is desirable to have the mechanism to be approximately optimal with respect to a chosen objective function. Several models for such approximation mechanism design without money for facility games have been proposed. In this paper we briefly review these models and related results for both deterministic and randomized mechanisms, and meanwhile we present a general framework for approximation mechanism design without money for facility games

Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems

The reoptimization issue studied in this paper can be described as follows: given an instance I of some problem Π, an optimal solution OPT for Π in I and an instance I′ resulting from a local perturbation of I that consists of insertions or removals of a small number of data, we wish to use OPT in order to solve Π in I', either optimally or by guaranteeing an approximation ratio better than that guaranteed by an ex nihilo computation and with running time better than that needed for such a computation. We use this setting in order to study weighted versions of several representatives of a broad class of problems known in the literature as maximum induced hereditary subgraph problems. The main problems studied are max independent set, max k-colorable subgraph and max split subgraph under vertex insertions and deletion

Inter-network regions of the Sun at millimetre wavelengths

The continuum intensity at wavelengths around 1 mm provides an excellent way to probe the solar chromosphere. Future high-resolution millimetre arrays, such as the Atacama Large Millimeter Array (ALMA), will thus produce valuable input for the ongoing controversy on the thermal structure and the dynamics of this layer. Synthetic brightness temperature maps are calculated on basis of three-dimensional radiation (magneto-)hydrodynamic (MHD) simulations. While the millimetre continuum at 0.3mm originates mainly from the upper photosphere, the longer wavelengths considered here map the low and middle chromosphere. The effective formation height increases generally with wavelength and also from disk-centre towards the solar limb. The average intensity contribution functions are usually rather broad and in some cases they are even double-peaked as there are contributions from hot shock waves and cool post-shock regions in the model chromosphere. Taking into account the deviations from ionisation equilibrium for hydrogen gives a less strong variation of the electron density and with it of the optical depth. The result is a narrower formation height range. The average brightness temperature increases with wavelength and towards the limb. The relative contrast depends on wavelength in the same way as the average intensity but decreases towards the limb. The dependence of the brightness temperature distribution on wavelength and disk-position can be explained with the differences in formation height and the variation of temperature fluctuations with height in the model atmospheres.Comment: 15 pages, 10 figures, accepted for publication in A&A (15.05.07

Extension of Some Edge Graph Problems: Standard and Parameterized Complexity

Le PDF est une version auteur non publiée.We consider extension variants of some edge optimization problems in graphs containing the classical Edge Cover, Matching, and Edge Dominating Set problems. Given a graph G=(V,E) and an edge set U⊆E, it is asked whether there exists an inclusion-wise minimal (resp., maximal) feasible solution E′ which satisfies a given property, for instance, being an edge dominating set (resp., a matching) and containing the forced edge set U (resp., avoiding any edges from the forbidden edge set E∖U). We present hardness results for these problems, for restricted instances such as bipartite or planar graphs. We counter-balance these negative results with parameterized complexity results. We also consider the price of extension, a natural optimization problem variant of extension problems, leading to some approximation results

Constraints on the Nucleon Strange Form Factors at Q^2 ~ 0.1 GeV^2

We report the most precise measurement to date of a parity-violating asymmetry in elastic electron-proton scattering. The measurement was carried out with a beam energy of 3.03 GeV and a scattering angle =6 degrees, with the result A_PV = -1.14 +/- 0.24 (stat) +/- 0.06 (syst) parts per million. From this we extract, at Q^2 = 0.099 GeV^2, the strange form factor combination G_E^s + 0.080 G_M^s = 0.030 +/- 0.025 (stat) +/- 0.006 (syst) +/- 0.012 (FF) where the first two errors are experimental and the last error is due to the uncertainty in the neutron electromagnetic form factor. This result significantly improves current knowledge of G_E^s and G_M^s at Q^2 ~0.1 GeV^2. A consistent picture emerges when several measurements at about the same Q^2 value are combined: G_E^s is consistent with zero while G_M^s prefers positive values though G_E^s=G_M^s=0 is compatible with the data at 95% C.L.Comment: minor wording changes for clarity, updated references, dropped one figure to improve focu

Recoil Polarization Measurements for Neutral Pion Electroproduction at Q^2=1 (GeV/c)^2 Near the Delta Resonance

We measured angular distributions of differential cross section, beam analyzing power, and recoil polarization for neutral pion electroproduction at Q^2 = 1.0 (GeV/c)^2 in 10 bins of W across the Delta resonance. A total of 16 independent response functions were extracted, of which 12 were observed for the first time. Comparisons with recent model calculations show that response functions governed by real parts of interference products are determined relatively well near 1.232 GeV, but variations among models is large for response functions governed by imaginary parts and for both increases rapidly with W. We performed a nearly model-independent multipole analysis that adjusts complex multipoles with high partial waves constrained by baseline models. Parabolic fits to the W dependence of the multipole analysis around the Delta mass gives values for SMR = (-6.61 +/- 0.18)% and EMR = (-2.87 +/- 0.19)% that are distinctly larger than those from Legendre analysis of the same data. Similarly, the multipole analysis gives Re(S0+/M1+) = (+7.1 +/- 0.8)% at W=1.232 GeV, consistent with recent models, while the traditional Legendre analysis gives the opposite sign because its truncation errors are quite severe. Finally, using a unitary isobar model (UIM), we find that excitation of the Roper resonance is dominantly longitudinal with S1/2 = (0.05 +/- 0.01) GeV^(-1/2) at Q^2=1. The ReS0+ and ReE0+ multipoles favor pseudovector coupling over pseudoscalar coupling or a recently proposed mixed-coupling scheme, but the UIM does not reproduce the imaginary parts of 0+ multipoles well.Comment: 60 pages, 54 figure

Recoil Polarization for Delta Excitation in Pion Electroproduction

We measured angular distributions of recoil-polarization response functions for neutral pion electroproduction for W=1.23 GeV at Q^2=1.0 (GeV/c)^2, obtaining 14 separated response functions plus 2 Rosenbluth combinations; of these, 12 have been observed for the first time. Dynamical models do not describe quantities governed by imaginary parts of interference products well, indicating the need for adjusting magnitudes and phases for nonresonant amplitudes. We performed a nearly model-independent multipole analysis and obtained values for Re(S1+/M1+)=-(6.84+/-0.15)% and Re(E1+/M1+)=-(2.91+/-0.19)% that are distinctly different from those from the traditional Legendre analysis based upon M1+ dominance and sp truncation.Comment: 5 pages, 2 figures, for PR