Inelastic Decay of Electrons in the Shockley-type Metal-Organic Interface States

We present a theoretical study of lifetimes of interface states (IS) on metal-organic interfaces PTCDA/Ag(111), NTCDA/Ag(111), PFP/Ag(111), and PTCDA/Ag(100), describing and explaining the recent experimental data. By means of unfolding the band structure of one of the interfaces under study onto the Ag(111) Brillouin zone we demonstrate, that the Brillouin zone folding upon organic monolayer deposition plays a minor role in the phase space for electron decay, and hence weakly affects the resulting lifetimes. The presence of the unoccupied molecular states below the IS gives a small contribution to the IS decay rate mostly determined by the change of the phase space of bulk states upon the energy shift of the IS. The calculated lifetimes follow the experimentally observed trends. In particular, we explain the trend of the unusual increase of the IS lifetimes with rising temperature.Comment: 8 pages, 5 figure

On Linear Congestion Games with Altruistic Social Context

We study the issues of existence and inefficiency of pure Nash equilibria in linear congestion games with altruistic social context, in the spirit of the model recently proposed by de Keijzer {\em et al.} \cite{DSAB13}. In such a framework, given a real matrix $\Gamma=(\gamma_{ij})$ specifying a particular social context, each player $i$ aims at optimizing a linear combination of the payoffs of all the players in the game, where, for each player $j$, the multiplicative coefficient is given by the value $\gamma_{ij}$. We give a broad characterization of the social contexts for which pure Nash equilibria are always guaranteed to exist and provide tight or almost tight bounds on their prices of anarchy and stability. In some of the considered cases, our achievements either improve or extend results previously known in the literature

Measuring the FSR--inclusive pi+pi- cross section

Final state radiation (FSR) in pion--pair production cannot be calculated reliably because of the composite structure of the pions. However, FSR corrections have to be taken into account for a precise evaluation of the hadronic contribution to g-2 of the muon. The role of FSR in both energy scan and radiative return experiments is discussed. It is shown how FSR influences the pion form factor extraction from experimental data and, as a consequence, the evaluation of a_mu^had. In fact the O(alpha) FSR corrections should be included to reach the precision we are aiming at. We argue that for an extraction of the desired FSR--inclusive cross section sigma^(gamma)_had a photon--inclusive scan measurement of the ``e+e- to pi+pi- + photons'' cross section is needed. For exclusive scan and radiative return measurements in contrast we have to rely on ad hoc FSR models if we want to obtain either sigma^(gamma)_had or the FSR--exclusive cross section sigma^(0)_had. We thus advocate to consider seriously precise photon--inclusive energy scan measurements at present and future low energy e+e- facilities. Then together with radiative return measurements from DAFNE and BABAR and forthcoming scan measurements at VEPP-2000 we have a good chance to substantially improve the evaluation of a_mu^had in the future.Comment: 18 pages, 13 Figure

Packing Returning Secretaries

We study online secretary problems with returns in combinatorial packing domains with $n$ candidates that arrive sequentially over time in random order. The goal is to accept a feasible packing of candidates of maximum total value. In the first variant, each candidate arrives exactly twice. All $2n$ arrivals occur in random order. We propose a simple 0.5-competitive algorithm that can be combined with arbitrary approximation algorithms for the packing domain, even when the total value of candidates is a subadditive function. For bipartite matching, we obtain an algorithm with competitive ratio at least $0.5721 - o(1)$ for growing $n$, and an algorithm with ratio at least $0.5459$ for all $n \ge 1$. We extend all algorithms and ratios to $k \ge 2$ arrivals per candidate. In the second variant, there is a pool of undecided candidates. In each round, a random candidate from the pool arrives. Upon arrival a candidate can be either decided (accept/reject) or postponed (returned into the pool). We mainly focus on minimizing the expected number of postponements when computing an optimal solution. An expected number of $\Theta(n \log n)$ is always sufficient. For matroids, we show that the expected number can be reduced to $O(r \log (n/r))$, where $r \le n/2$ is the minimum of the ranks of matroid and dual matroid. For bipartite matching, we show a bound of $O(r \log n)$, where $r$ is the size of the optimum matching. For general packing, we show a lower bound of $\Omega(n \log \log n)$, even when the size of the optimum is $r = \Theta(\log n)$.Comment: 23 pages, 5 figure

Measurement of scaling laws for shock waves in thermal nonlocal media

We are able to detect the details of spatial optical collisionless wave-breaking through the high aperture imaging of a beam suffering shock in a fluorescent nonlinear nonlocal thermal medium. This allows us to directly measure how nonlocality and nonlinearity affect the point of shock formation and compare results with numerical simulations.Comment: 4 pages, 4 figure

A note on anti-coordination and social interactions

This note confirms a conjecture of [Bramoull\'{e}, Anti-coordination and social interactions, Games and Economic Behavior, 58, 2007: 30-49]. The problem, which we name the maximum independent cut problem, is a restricted version of the MAX-CUT problem, requiring one side of the cut to be an independent set. We show that the maximum independent cut problem does not admit any polynomial time algorithm with approximation ratio better than $n^{1-\epsilon}$, where $n$ is the number of nodes, and $\epsilon$ arbitrarily small, unless P=NP. For the rather special case where each node has a degree of at most four, the problem is still MAXSNP-hard.Comment: 7 page

Computing Stable Coalitions: Approximation Algorithms for Reward Sharing

Consider a setting where selfish agents are to be assigned to coalitions or projects from a fixed set P. Each project k is characterized by a valuation function; v_k(S) is the value generated by a set S of agents working on project k. We study the following classic problem in this setting: "how should the agents divide the value that they collectively create?". One traditional approach in cooperative game theory is to study core stability with the implicit assumption that there are infinite copies of one project, and agents can partition themselves into any number of coalitions. In contrast, we consider a model with a finite number of non-identical projects; this makes computing both high-welfare solutions and core payments highly non-trivial. The main contribution of this paper is a black-box mechanism that reduces the problem of computing a near-optimal core stable solution to the purely algorithmic problem of welfare maximization; we apply this to compute an approximately core stable solution that extracts one-fourth of the optimal social welfare for the class of subadditive valuations. We also show much stronger results for several popular sub-classes: anonymous, fractionally subadditive, and submodular valuations, as well as provide new approximation algorithms for welfare maximization with anonymous functions. Finally, we establish a connection between our setting and the well-studied simultaneous auctions with item bidding; we adapt our results to compute approximate pure Nash equilibria for these auctions.Comment: Under Revie

Network Creation Games: Think Global - Act Local

We investigate a non-cooperative game-theoretic model for the formation of communication networks by selfish agents. Each agent aims for a central position at minimum cost for creating edges. In particular, the general model (Fabrikant et al., PODC'03) became popular for studying the structure of the Internet or social networks. Despite its significance, locality in this game was first studied only recently (Bil\`o et al., SPAA'14), where a worst case locality model was presented, which came with a high efficiency loss in terms of quality of equilibria. Our main contribution is a new and more optimistic view on locality: agents are limited in their knowledge and actions to their local view ranges, but can probe different strategies and finally choose the best. We study the influence of our locality notion on the hardness of computing best responses, convergence to equilibria, and quality of equilibria. Moreover, we compare the strength of local versus non-local strategy-changes. Our results address the gap between the original model and the worst case locality variant. On the bright side, our efficiency results are in line with observations from the original model, yet we have a non-constant lower bound on the price of anarchy.Comment: An extended abstract of this paper has been accepted for publication in the proceedings of the 40th International Conference on Mathematical Foundations on Computer Scienc

Enhance the Efficiency of Heuristic Algorithm for Maximizing Modularity Q

Modularity Q is an important function for identifying community structure in complex networks. In this paper, we prove that the modularity maximization problem is equivalent to a nonconvex quadratic programming problem. This result provide us a simple way to improve the efficiency of heuristic algorithms for maximizing modularity Q. Many numerical results demonstrate that it is very effective.Comment: 9 pages, 3 figure