Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Group decision and negotiation 5 (1996), S. 263-282 
    ISSN: 1572-9907
    Keywords: social choice function ; strategy-proofness ; manipulability ; strong and exact consistency ; voting method ; balanced voting
    Source: Springer Online Journal Archives 1860-2000
    Topics: Psychology
    Notes: Abstract We consider the proportion of profiles at which an anonymous neutral social choice function cannot be manipulated to any coalition's advantage. We fix the number of alternatives and consider the limit as the number of individuals goes to infinity, and assume that the limit of the fraction of all profiles in the domain is 1. We show that there is a continuous function on “profile vectors’ which gives the maximum probability of strategy-proofness, and that this is strictly between 0 and 1 for three alternatives. We also analyze a number of common social choice functions along these lines.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Group decision and negotiation 5 (1996), S. 263-282 
    ISSN: 1572-9907
    Keywords: social choice function ; strategy-proofness ; manipulability ; strong and exact consistency ; voting method ; balanced voting
    Source: Springer Online Journal Archives 1860-2000
    Topics: Psychology
    Notes: Abstract We consider the proportion of profiles at which an anonymous neutral social choice function cannot be manipulated to any coalition's advantage. We fix the number of alternatives and consider the limit as the number of individuals goes to infinity, and assume that the limit of the fraction of all profiles in the domain is 1. We show that there is a continuous function on “profile vectors’ which gives the maximum probability of strategy-proofness, and that this is strictly between 0 and 1 for three alternatives. We also analyze a number of common social choice functions along these lines.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Medical & biological engineering & computing 38 (2000), S. 469-472 
    ISSN: 1741-0444
    Keywords: Extracellular recording ; Active neural probe ; CMOS ; Source follower ; Differential amplifier ; Signal-to-device-noise ratio
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Chemistry and Pharmacology , Medicine
    Notes: Abstract A noise performance design method for the pre-amplifiers of an active neural probe is given. The on-chip circuitry of the active neural probe consists of CMOS devices that show high-/ low-frequency noise, so that the device noise can become dominant. Analysis of the signal-to-device-noise ratio (SDNR) for the CMOS source follower buffer and two-stage differential voltage amplifier is given. Closed-form expressions for the output noise power are derived and exploited to tailor the parameters that are controllable during circuit design. The output SDNR is calculated considering the real extracellular action potentials, the electrode-electrolyte interface and the noise spectrum of CMOS devices from typical foundries. It is shown that the output device noise power can be much higher than the output signal power if the devices at the input stage of the pre-amplifier are made as small as given fabrication technology permits. Quantitative information of the circuit parameters to achieve an SDNR higher than 5 for neural spikes with 60μV amplitude are provided for both preamplifier types.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...