377 research outputs found
Performance evaluation of an open distributed platform for realistic traffic generation
Network researchers have dedicated a notable part of their efforts
to the area of modeling traffic and to the implementation of efficient traffic
generators. We feel that there is a strong demand for traffic generators
capable to reproduce realistic traffic patterns according to theoretical
models and at the same time with high performance. This work presents an open
distributed platform for traffic generation that we called distributed
internet traffic generator (D-ITG), capable of producing traffic (network,
transport and application layer) at packet level and of accurately replicating
appropriate stochastic processes for both inter departure time (IDT) and
packet size (PS) random variables. We implemented two different versions of
our distributed generator. In the first one, a log server is in charge of
recording the information transmitted by senders and receivers and these
communications are based either on TCP or UDP. In the other one, senders and
receivers make use of the MPI library. In this work a complete performance
comparison among the centralized version and the two distributed versions of
D-ITG is presented
Obvious strategyproofness needs monitoring for good approximations
Obvious strategyproofness (OSP) is an appealing concept as it allows to maintain incentive compatibility even in the presence of agents that are not fully rational, e.g., those who struggle with contingent reasoning (Li 2015). However, it has been shown to impose some limitations, e.g., no OSP mechanism can return a stable matching (Ashlagi and Gonczarowski 2015). We here deepen the study of the limitations of OSP mechanisms by looking at their approximation guarantees for basic optimization problems paradigmatic of the area, i.e., machine scheduling and facility location. We prove a number of bounds on the approximation guarantee of OSP mechanisms, which show that OSP can come at a significant cost. However, rather surprisingly, we prove that OSP mechanisms can return optimal solutions when they use monitoring?a novel mechanism design paradigm that introduces a mild level of scrutiny on agents? declarations (Kovács, Meyer, and Ventre 2015)
Social Pressure in Opinion Games
Motivated by privacy and security concerns in online social networks, we study the role of social pressure in opinion games. These are games, important in economics and sociology, that model the formation of opinions in a social network. We enrich the definition of (noisy) best-response dynamics for opinion games by introducing the pressure, increasing with time, to reach an agreement. We prove that for clique social networks, the dynamics always converges to consensus (no matter the level of noise) if the social pressure is high enough. Moreover, we provide (tight) bounds on the speed of convergence; these bounds are polynomial in the number of players provided that the pressure grows sufficiently fast. We finally look beyond cliques: we characterize the graphs for which consensus is guaranteed, and make some considerations on the computational complexity of checking whether a graph satisfies such a condition
Obvious strategyproofness needs monitoring for good approximations (extended abstract)
Obvious strategyproofness (OSP) is an appealing concept as it allows to maintain incentive compatibility even in the presence of agents that are not fully rational, e.g., those who struggle with contingent reasoning [10]. However, it has been shown to impose some limitations, e.g., no OSP mechanism can return a stable matching [3] . We here deepen the study of the limitations of OSP mechanisms by look-ing at their approximation guarantees for basic optimization problems paradigmatic of the area, i.e., machine scheduling and facility location. We prove a number of bounds on the approximation guarantee of OSP mechanisms, which show that OSP can come at a signifificant cost. How-ever, rather surprisingly, we prove that OSP mechanisms can return opti-mal solutions when they use monitoring|a mechanism design paradigm that introduces a mild level of scrutiny on agents' declarations [9]
The Power of Verification for Greedy Mechanism Design
Greedy algorithms are known to provide, in polynomial time, near optimal approximation guarantees for Combinatorial Auctions (CAs) with multidimensional bidders. It is known that truthful greedy-like mechanisms for CAs with multi-minded bidders do not achieve good approximation guarantees.
In this work, we seek a deeper understanding of greedy mechanism design and investigate under which general assumptions, we can have efficient and truthful greedy mechanisms for CAs. Towards this goal, we use the framework of priority algorithms and weak and strong verification, where the bidders are not allowed to overbid on their winning set or on any subset of this set, respectively. We provide a complete characterization of the power of weak verification showing that it is sufficient and necessary for any greedy fixed priority algorithm to become truthful with the use of money or not, depending on the ordering of the bids. Moreover, we show that strong verification is sufficient and necessary to obtain a 2-approximate truthful mechanism with money, based on a known greedy algorithm, for the problem of submodular CAs in finite bidding domains. Our proof is based on an interesting structural analysis of the strongly connected components of the declaration graph
The Power of Verification for Greedy Mechanism Design
Greedy algorithms are known to provide near optimal approximation guarantees for Combinatorial Auctions (CAs) with multidimensional bidders, ignoring incentive compatibility. Borodin and Lucier [5] however proved that truthful greedy-like mechanisms for CAs with multi-minded bidders do not achieve good approximation guarantees. In this work, we seek a deeper understanding of greedy mechanism design and investigate under which general assumptions, we can have efficient and truthful greedy mechanisms for CAs. Towards this goal, we use the framework of priority algorithms and weak and strong verification, where the bidders are not allowed to overbid on their winning set or on any subsets of this set, respectively. We provide a complete characterization of the power of weak verification showing that it is sufficient and necessary for any greedy fixed priority algorithm to become truthful with the use of money or not, depending on the ordering of the bids. Moreover, we show that strong verification is sufficient and necessary for the greedy algorithm of [20], which is 2-approximate for submodular CAs, to become truthful with money in finite bidding domains. Our proof is based on an interesting structural analysis of the strongly connected components of the declaration graph
Clearing Financial Networks with Derivatives: From Intractability to Algorithms
Financial networks raise a significant computational challenge in identifying
insolvent firms and evaluating their exposure to systemic risk. This task,
known as the clearing problem, is computationally tractable when dealing with
simple debt contracts. However under the presence of certain derivatives called
credit default swaps (CDSes) the clearing problem is -complete.
Existing techniques only show -hardness for finding an
-solution for the clearing problem with CDSes within an unspecified
small range for .
We present significant progress in both facets of the clearing problem: (i)
intractability of approximate solutions; (ii) algorithms and heuristics for
computable solutions. Leveraging (FOCS'22), we provide
the first explicit inapproximability bound for the clearing problem involving
CDSes. Our primal contribution is a reduction from
which establishes that finding approximate solutions is -hard
within a range of roughly 5%.
To alleviate the complexity of the clearing problem, we identify two
meaningful restrictions of the class of financial networks motivated by
regulations: (i) the presence of a central clearing authority; and (ii) the
restriction to covered CDSes. We provide the following results: (i.) The
-hardness of approximation persists when central clearing
authorities are introduced; (ii.) An optimisation-based method for solving the
clearing problem with central clearing authorities; (iii.) A polynomial-time
algorithm when the two restrictions hold simultaneously
Evidence for cognitive vestibular integration impairment in idiopathic scoliosis patients
<p>Abstract</p> <p>Background</p> <p>Adolescent idiopathic scoliosis is characterized by a three-dimensional deviation of the vertebral column and its etiopathogenesis is unknown. Various factors cause idiopathic scoliosis, and among these a prominent role has been attributed to the vestibular system. While the deficits in sensorimotor transformations have been documented in idiopathic scoliosis patients, little attention has been devoted to their capacity to integrate vestibular information for cognitive processing for space perception. Seated idiopathic scoliosis patients and control subjects experienced rotations of different directions and amplitudes in the dark and produced saccades that would reproduce their perceived spatial characteristics of the rotations (vestibular condition). We also controlled for possible alteration of the oculomotor and vestibular systems by measuring the subject's accuracy in producing saccades towards memorized peripheral targets in absence of body rotation and the gain of their vestibulo-ocular reflex.</p> <p>Results</p> <p>Compared to healthy controls, the idiopathic scoliosis patients underestimated the amplitude of their rotations. Moreover, the results revealed that idiopathic scoliosis patients produced accurate saccades to memorized peripheral targets in absence of body rotation and that their vestibulo-ocular reflex gain did not differ from that of control participants.</p> <p>Conclusion</p> <p>Overall, results of the present study demonstrate that idiopathic scoliosis patients have an alteration in cognitive integration of vestibular signals. It is possible that severe spine deformity developed partly due to impaired vestibular information travelling from the cerebellum to the vestibular cortical network or alteration in the cortical mechanisms processing the vestibular signals.</p
Making Sigma-Protocols Non-interactive Without Random Oracles
DamgËšard, Fazio and Nicolosi (TCC 2006) gave a transformation of Sigma-protocols, 3-move honest verifier zero-knowledge proofs, into efficient non-interactive zero-knowledge arguments for a designated verifier. Their transformation uses additively homomorphic encryption
to encrypt the verifier’s challenge, which the prover uses to compute an encrypted answer. The transformation does not rely on the random oracle model but proving soundness requires a complexity leveraging assumption.
We propose an alternative instantiation of their transformation and show that it achieves culpable soundness without complexity leveraging. This
improves upon an earlier result by Ventre and Visconti (Africacrypt 2009), who used a different construction which achieved weak culpable soundness.
We demonstrate how our construction can be used to prove validity of encrypted votes in a referendum. This yields a voting system with homomorphic tallying that does not rely on the Fiat-Shamir heuristic
Business and Social Evaluation of Denial of Service Attacks in View of Scaling Economic Counter-Measures
- …