1,398 research outputs found

    Settling the Sample Complexity of Single-parameter Revenue Maximization

    Full text link
    This paper settles the sample complexity of single-parameter revenue maximization by showing matching upper and lower bounds, up to a poly-logarithmic factor, for all families of value distributions that have been considered in the literature. The upper bounds are unified under a novel framework, which builds on the strong revenue monotonicity by Devanur, Huang, and Psomas (STOC 2016), and an information theoretic argument. This is fundamentally different from the previous approaches that rely on either constructing an ϵ\epsilon-net of the mechanism space, explicitly or implicitly via statistical learning theory, or learning an approximately accurate version of the virtual values. To our knowledge, it is the first time information theoretical arguments are used to show sample complexity upper bounds, instead of lower bounds. Our lower bounds are also unified under a meta construction of hard instances.Comment: 49 pages, Accepted by STOC1

    Swap Stability in Schelling Games on Graphs

    Get PDF
    We study a recently introduced class of strategic games thatis motivated by and generalizes Schelling’s well-known resi-dential segregation model. These games are played on undi-rected graphs, with the set of agents partitioned into multi-ple types; each agent either occupies a node of the graph andnever moves away or aims to maximize the fraction of herneighbors who are of her own type. We consider a variant ofthis model that we call swap Schelling games, where the num-ber of agents is equal to the number of nodes of the graph, andagents mayswappositions with other agents to increase theirutility. We study the existence, computational complexity andquality of equilibrium assignments in these games, both froma social welfare perspective and from a diversity perspective

    Protecting elections by recounting ballots

    Get PDF
    Complexity of voting manipulation is a prominent topic in computational social choice. In this work, we consider a two-stage voting manipulation scenario. First, a malicious party (an attacker) attempts to manipulate the election outcome in favor of a preferred candidate by changing the vote counts in some of the voting districts. Afterwards, another party (a defender), which cares about the voters' wishes, demands a recount in a subset of the manipulated districts, restoring their vote counts to their original values. We investigate the resulting Stackelberg game for the case where votes are aggregated using two variants of the Plurality rule, and obtain an almost complete picture of the complexity landscape, both from the attacker's and from the defender's perspective

    Schelling games on graphs

    Get PDF
    We consider strategic games that are inspired by Schelling's model of residential segregation. In our model, the agents are partitioned into k types and need to select locations on an undirected graph. Agents can be either stubborn, in which case they will always choose their preferred location, or strategic, in which case they aim to maximize the fraction of agents of their own type in their neighborhood. We investigate the existence of equilibria in these games, study the complexity of finding an equilibrium outcome or an outcome with high social welfare, and also provide upper and lower bounds on the price of anarchy and stability. Some of our results extend to the setting where the preferences of the agents over their neighbors are defined by a social network rather than a partition into types

    H-Diplo Roundtable XXII-30 on Nichter. The Last Brahmin: Henry Cabot Lodge Jr. and the Making of the Cold War

    Get PDF
    A set of reviews of Luke A. Nichter\u27s The Last Brahmin: Henry Cabot Lodge Jr. and the Making of the Cold War, with a response from the author

    Determination of cutting forces based on DMG MORI CTX300 ecoline CNC lathe drive power data

    Full text link
    Modern machine building needs demand for machines and control systems which provide higher accuracy of machining. For this purpose, setup methods are being researched and accuracy of machines and devices is being improved. The main topic of this paper is a tool path predistortion system which is necessary for improvement of shaft turning accuracy when a steady rest cannot be used on a CNC machines. Calculation of such tool path requires one to know the cutting force during turning on a CNC lathe. The research in question allowed to determine the dependence of cutting force during turning on the power consumed by the feed drive, cutting depth, cutting velocity, and feed value. An equation for further calculation applicable to a specific lathe in the turning process was derived. This equation serves as basis for adaptive turning of shafts and other parts with the aid of a mathematical model, which must account for the cutting force. Application of this formula in a CNC controlled lathe's parametric program will provide for higher accuracy of turning without special devices. © Published under licence by IOP Publishing Ltd

    Absence of a dose-rate effect in the transformation of C3H 10T1/2 cells by α-particles

    Get PDF
    The findings of Hill et al. (1984) on the greatly enhanced transformation frequencies at very low dose rates of fission neutrons induced us to perform an analogous study with -particles at comparable dose rates. Transformation frequencies were determined with γ-rays at high dose rate (0·5 Gy/min), and with -particles at high (0·2 Gy/min) and at low dose rates (0·83-2·5 mGy/min) in the C3H 10T1/2 cell system. α-particles were substantially more effective than γ-rays, both for cell inactivation and for neoplastic transformation at high and low dose rates. The relative biological effectiveness (RBE) for cell inactivation and for neoplastic transformation was of similar magnitude, and ranged from about 3 at an -particle dose of 2 Gy to values of the order of 10 at 0·25 Gy. In contrast to the experiments of Hill et al. (1984) with fission neutrons, no increased transformation frequencies were observed when the -particle dose was protracted over several hours

    Botulinum toxin type A in the prophylactic treatment of chronic tension-type headache: A multicentre, double-blind, randomized, placebo-controlled, parallel-group study

    Get PDF
    We studied the safety and efficacy of 0 U, 50 U, 100 U, 150 U (five sites), 86 Usub and 100 Usub (three sites) botulinum toxin type A (BoNTA; BOTOX); Allergan, Inc., Irvine, CA, USA) for the prophylaxis of chronic tension-type headache (CTTH). Three hundred patients (62.3% female; mean age 42.6 years) enrolled. For the primary endpoint, the mean change from baseline in the number of TTH-free days per month, there was no statistically significant difference between placebo and four BoNTA groups, but a significant difference favouring placebo vs. BoNTA 150 was observed (4.5 vs. 2.8 tension headache-free days/month; P = 0.007). All treatment groups improved at day 60. Although efficacy was not demonstrated for the primary endpoint, at day 90, more patients in three BoNTA groups had \u3eor=50% decrease in tension headache days than did placebo (
    corecore