Selfish Knapsack

We consider a selfish variant of the knapsack problem. In our version, the items are owned by agents, and each agent can misrepresent the set of items she owns---either by avoiding reporting some of them (understating), or by reporting additional ones that do not exist (overstating). Each agent's objective is to maximize, within the items chosen for inclusion in the knapsack, the total valuation of her own chosen items. The knapsack problem, in this context, seeks to minimize the worst-case approximation ratio for social welfare at equilibrium. We show that a randomized greedy mechanism has attractive strategic properties: in general, it has a correlated price of anarchy of $2$ (subject to a mild assumption). For overstating-only agents, it becomes strategyproof; we also provide a matching lower bound of $2$ on the (worst-case) approximation ratio attainable by randomized strategyproof mechanisms, and show that no deterministic strategyproof mechanism can provide any constant approximation ratio. We also deal with more specialized environments. For the case of $2$ understating-only agents, we provide a randomized strategyproof $\frac{5+4\sqrt{2}}{7} \approx 1.522$-approximate mechanism, and a lower bound of $\frac{5\sqrt{5}-9}{2} \approx 1.09$. When all agents but one are honest, we provide a deterministic strategyproof $\frac{1+\sqrt{5}}{2} \approx 1.618$-approximate mechanism with a matching lower bound. Finally, we consider a model where agents can misreport their items' properties rather than existence. Specifically, each agent owns a single item, whose value-to-size ratio is publicly known, but whose actual value and size are not. We show that an adaptation of the greedy mechanism is strategyproof and $2$-approximate, and provide a matching lower bound; we also show that no deterministic strategyproof mechanism can provide a constant approximation ratio

More on A Statistical Analysis of Log-Periodic Precursors to Financial Crashes

We respond to Sornette and Johansen's criticisms of our findings regarding log-periodic precursors to financial crashes. Included in this paper are discussions of the Sornette-Johansen theoretical paradigm, traditional methods of identifying log-periodic precursors, the behavior of the first differences of a log-periodic price series, and the distribution of drawdowns for a securities price.Comment: 12 LaTex pages, no figure

Programming of inhomogeneous resonant guided wave networks

Photonic functions are programmed by designing the interference of local waves in inhomogeneous resonant guided wave networks composed of power-splitting elements arranged at the nodes of a nonuniform waveguide network. Using a compact, yet comprehensive, scattering matrix representation of the network, the desired photonic function is designed by fitting structural parameters according to an optimization procedure. This design scheme is demonstrated for plasmonic dichroic and trichroic routers in the infrared frequency range

Multifractality of the Feigenbaum attractor and fractional derivatives

It is shown that fractional derivatives of the (integrated) invariant measure of the Feigenbaum map at the onset of chaos have power-law tails in their cumulative distributions, whose exponents can be related to the spectrum of singularities $f(\alpha)$. This is a new way of characterizing multifractality in dynamical systems, so far applied only to multifractal random functions (Frisch and Matsumoto (J. Stat. Phys. 108:1181, 2002)). The relation between the thermodynamic approach (Vul, Sinai and Khanin (Russian Math. Surveys 39:1, 1984)) and that based on singularities of the invariant measures is also examined. The theory for fractional derivatives is developed from a heuristic point view and tested by very accurate simulations.Comment: 20 pages, 5 figures, J.Stat.Phys. in pres

Semi-Streaming Set Cover

This paper studies the set cover problem under the semi-streaming model. The underlying set system is formalized in terms of a hypergraph $G = (V, E)$ whose edges arrive one-by-one and the goal is to construct an edge cover $F \subseteq E$ with the objective of minimizing the cardinality (or cost in the weighted case) of $F$. We consider a parameterized relaxation of this problem, where given some $0 \leq \epsilon < 1$, the goal is to construct an edge $(1 - \epsilon)$-cover, namely, a subset of edges incident to all but an $\epsilon$-fraction of the vertices (or their benefit in the weighted case). The key limitation imposed on the algorithm is that its space is limited to (poly)logarithmically many bits per vertex. Our main result is an asymptotically tight trade-off between $\epsilon$ and the approximation ratio: We design a semi-streaming algorithm that on input graph $G$, constructs a succinct data structure $\mathcal{D}$ such that for every $0 \leq \epsilon < 1$, an edge $(1 - \epsilon)$-cover that approximates the optimal edge \mbox{($1$-)cover} within a factor of $f(\epsilon, n)$ can be extracted from $\mathcal{D}$ (efficiently and with no additional space requirements), where $$f(\epsilon, n) = \left\{ \begin{array}{ll} O (1 / \epsilon), & \text{if } \epsilon > 1 / \sqrt{n} \\ O (\sqrt{n}), & \text{otherwise} \end{array} \right. \, .$$ In particular for the traditional set cover problem we obtain an $O(\sqrt{n})$-approximation. This algorithm is proved to be best possible by establishing a family (parameterized by $\epsilon$) of matching lower bounds.Comment: Full version of the extended abstract that will appear in Proceedings of ICALP 2014 track

Activist Reflexivity and Mediated Violence: Putting the Policing of Nuit Debout in Context

To better understand the historical trajectory of the policing of Nuit Debout, in this article we argue that the reflexive relationship between police and protest tactics is heavily mediated by the presence of the press and by the emergence of digital technologies. Our analysis focuses on three sets of reflexive activist practice: (a) challenging media representations—the adaptations and innovations that respond to dominant media framing of police–protester relations; (b) “sousveillance” and police monitoring—the recording and monitoring of police violence and the public education around the police’s use of force; (c) civic forensics and data aggregation—the gathering, analyzing, and collectivizing of citizen-generated data. Although not intended as a taxonomy, these groups of practices are offered as conceptual lenses for critically examining how activists’ tactical repertoires for protesting police adapt and evolve, building on each other to challenge the representational, legal, and material dimensions of state power as it manifests in police–protester relations

Efficient Coupling between Dielectric-Loaded Plasmonic and Silicon Photonic Waveguides

The realization of practical on-chip plasmonic devices will require efficient coupling of light into and out of surface plasmon waveguides over short length scales. In this letter, we report on low insertion loss for polymer-on-gold dielectric-loaded plasmonic waveguides end-coupled to silicon-on-insulator waveguides with a coupling efficiency of 79 ± 2% per transition at telecommunication wavelengths. Propagation loss is determined independently of insertion loss by measuring the transmission through plasmonic waveguides of varying length, and we find a characteristic surface-plasmon propagation length of 51 ± 4 μm at a free-space wavelength of λ = 1550 nm. We also demonstrate efficient coupling to whispering-gallery modes in plasmonic ring resonators with an average bending-loss-limited quality factor of 180 ± 8

Two-dimensional dissipative maps at chaos threshold: Sensitivity to initial conditions and relaxation dynamics

The sensitivity to initial conditions and relaxation dynamics of two-dimensional maps are analyzed at the edge of chaos, along the lines of nonextensive statistical mechanics. We verify the dual nature of the entropic index for the Henon map, one ($q_{sen}<1$) related to its sensitivity to initial conditions properties, and the other, graining-dependent ($q_{rel}(W)>1$), related to its relaxation dynamics towards its stationary state attractor. We also corroborate a scaling law between these two indexes, previously found for $z$-logistic maps. Finally we perform a preliminary analysis of a linearized version of the Henon map (the smoothed Lozi map). We find that the sensitivity properties of all these $z$-logistic, Henon and Lozi maps are the same, $q_{sen}=0.2445...$Comment: Communication at NEXT2003, Second Sardinian International Conference on News and Expectations in Thermostatistics, Villasimius (Cagliari) Italy, 21-28 September 2003. Submitted to Physica A. Elsevier Latex, 8 pages, 6 eps figure

Classical Trajectories for Complex Hamiltonians

It has been found that complex non-Hermitian quantum-mechanical Hamiltonians may have entirely real spectra and generate unitary time evolution if they possess an unbroken \cP\cT symmetry. A well-studied class of such Hamiltonians is $H= p^2+x^2(ix)^\epsilon$ ($\epsilon\geq0$). This paper examines the underlying classical theory. Specifically, it explores the possible trajectories of a classical particle that is governed by this class of Hamiltonians. These trajectories exhibit an extraordinarily rich and elaborate structure that depends sensitively on the value of the parameter $\epsilon$ and on the initial conditions. A system for classifying complex orbits is presented.Comment: 24 pages, 34 figure

Iterated maps for clarinet-like systems

The dynamical equations of clarinet-like systems are known to be reducible to a non-linear iterated map within reasonable approximations. This leads to time oscillations that are represented by square signals, analogous to the Raman regime for string instruments. In this article, we study in more detail the properties of the corresponding non-linear iterations, with emphasis on the geometrical constructions that can be used to classify the various solutions (for instance with or without reed beating) as well as on the periodicity windows that occur within the chaotic region. In particular, we find a regime where period tripling occurs and examine the conditions for intermittency. We also show that, while the direct observation of the iteration function does not reveal much on the oscillation regime of the instrument, the graph of the high order iterates directly gives visible information on the oscillation regime (characterization of the number of period doubligs, chaotic behaviour, etc.)