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

Scotland, Catalonia and the “right” to self-determination: a comment suggested by Kathryn Crameri’s “Do Catalans Have the Right to Decide?

No abstract available

Topological Characterization of Hamming and Dragonfly Networks and its Implications on Routing

Current HPC and datacenter networks rely on large-radix routers. Hamming graphs (Cartesian products of complete graphs) and dragonflies (two-level direct networks with nodes organized in groups) are some direct topologies proposed for such networks. The original definition of the dragonfly topology is very loose, with several degrees of freedom such as the inter- and intra-group topology, the specific global connectivity and the number of parallel links between groups (or trunking level). This work provides a comprehensive analysis of the topological properties of the dragonfly network, providing balancing conditions for network dimensioning, as well as introducing and classifying several alternatives for the global connectivity and trunking level. From a topological study of the network, it is noted that a Hamming graph can be seen as a canonical dragonfly topology with a large level of trunking. Based on this observation and by carefully selecting the global connectivity, the Dimension Order Routing (DOR) mechanism safely used in Hamming graphs is adapted to dragonfly networks with trunking. The resulting routing algorithms approximate the performance of minimal, non-minimal and adaptive routings typically used in dragonflies, but without requiring virtual channels to avoid packet deadlock, thus allowing for lower-cost router implementations. This is obtained by selecting properly the link to route between groups, based on a graph coloring of the network routers. Evaluations show that the proposed mechanisms are competitive to traditional solutions when using the same number of virtual channels, and enable for simpler implementations with lower cost. Finally, multilevel dragonflies are discussed, considering how the proposed mechanisms could be adapted to them

On the universality of the Discrete Nonlinear Schroedinger Equation

We address the universal applicability of the discrete nonlinear Schroedinger equation. By employing an original but general top-down/bottom-up procedure based on symmetry analysis to the case of optical lattices, we derive the most widely applicable and the simplest possible model, revealing that the discrete nonlinear Schroedinger equation is ``universally'' fit to describe light propagation even in discrete tensorial nonlinear systems and in the presence of nonparaxial and vectorial effects.Comment: 6 Pages, to appear in Phys. Rev.

Gyrotropic impact upon negatively refracting surfaces

Surface wave propagation at the interface between different types of gyrotropic materials and an isotropic negatively refracting medium, in which the relative permittivity and relative permeability are, simultaneously, negative is investigated. A general approach is taken that embraces both gyroelectric and gyromagnetic materials, permitting the possibility of operating in either the low GHz, THz or the optical frequency regimes. The classical transverse Voigt configuration is adopted and a complete analysis of non-reciprocal surface wave dispersion is presented. The impact of the surface polariton modes upon the reflection of both plane waves and beams is discussed in terms of resonances and an example of the influence upon the Goos–Hänchen shift is given

Incidence and predictors of puerperal sepsis among postpartum women at Debre Markos comprehensive specialized hospital, northwest Ethiopia: A prospective cohort study

Background: Puerperal sepsis is one of the leading causes of maternal mortality, particularly in low and middle-income countries where most maternal deaths occur. Women with puerperal sepsis are prone to long-term disabilities, such as chronic pelvic pain, blocked fallopian tubes, and secondary infertility. Besides this, puerperal sepsis has received less attention. For this reason, this study aimed to determine the incidence of puerperal sepsis and its predictors among postpartum women at Debre Markos Comprehensive Specialized Hospital. Methods: A prospective cohort study was conducted among 330 postpartum women from September 2020 to 2021. A pre-tested interviewer-administered questionnaire with a data extraction checklist was used to collect the data. Data were entered into Epi data 4.2 and analyzed using STATA 14.0. The incidence rate of puerperal sepsis was calculated, and a Kaplan-Meier survival curve was used to estimate the survival probability of developing puerperal sepsis. The cox-proportional hazards regression model was fitted to identify predictors of puerperal sepsis. Results: The study participants were followed for a total of 1685.3 person-week observations. The incidence rate of puerperal sepsis was 14.24 per 1,000 person-weeks. However, the overall incidence of puerperal sepsis was 7.27%. Not attending formal education [AHR: 3.55, 95% CI: (1.09–11.58)], a cesarean delivery [AHR: 4.50; 95% CI: (1.79–11.30)], premature rupture of the membranes [AHR: 3.25; 95% CI: (1.08–9.79)], complicated pregnancy [AHR: 4.80; 95% CI: (1.85–12.43)], being referred [AHR: 2.90; 95% CI: (1.10–7.65)], and not having birth preparedness and complication readiness plan [AHR: 2.95; 95% CI: (1.08–10.50)] were statistically significant predictors of puerperal sepsis. Conclusion: The incidence of puerperal sepsis was 7.27%. Not attending formal education, cesarean delivery, premature rupture of membranes, complicated pregnancy, referral status, and absence of birth preparedness and complication readiness plan were predictors associated with the incidence of puerperal sepsis

The 'Parekh Report' - national identities with nations and nationalism

‘Multiculturalists’ often advocate national identities. Yet few study the ways in which ‘multiculturalists’ do so and in this article I will help to fill this gap. I will show that the Commission for Multi-Ethnic Britain’s report reflects a previously unnoticed way of thinking about the nature and worth of national identities that the Commission’s chair, and prominent political theorist, Bhikhu Parekh, had been developing since the 1970s. This way of thinking will be shown to avoid the questionable ways in which conservative and liberal nationalists discuss the nature and worth of national identities while offering an alternative way to do so. I will thus show that a report that was once criticised for the way it discussed national identities reflects how ‘multiculturalists’ think about national identities in a distinct and valuable way that has gone unrecognised

Parallel symbolic state-space exploration is difficult, but what is the alternative?

State-space exploration is an essential step in many modeling and analysis problems. Its goal is to find the states reachable from the initial state of a discrete-state model described. The state space can used to answer important questions, e.g., "Is there a dead state?" and "Can N become negative?", or as a starting point for sophisticated investigations expressed in temporal logic. Unfortunately, the state space is often so large that ordinary explicit data structures and sequential algorithms cannot cope, prompting the exploration of (1) parallel approaches using multiple processors, from simple workstation networks to shared-memory supercomputers, to satisfy large memory and runtime requirements and (2) symbolic approaches using decision diagrams to encode the large structured sets and relations manipulated during state-space generation. Both approaches have merits and limitations. Parallel explicit state-space generation is challenging, but almost linear speedup can be achieved; however, the analysis is ultimately limited by the memory and processors available. Symbolic methods are a heuristic that can efficiently encode many, but not all, functions over a structured and exponentially large domain; here the pitfalls are subtler: their performance varies widely depending on the class of decision diagram chosen, the state variable order, and obscure algorithmic parameters. As symbolic approaches are often much more efficient than explicit ones for many practical models, we argue for the need to parallelize symbolic state-space generation algorithms, so that we can realize the advantage of both approaches. This is a challenging endeavor, as the most efficient symbolic algorithm, Saturation, is inherently sequential. We conclude by discussing challenges, efforts, and promising directions toward this goal