10,771 research outputs found

    Nash implementation with little communication

    Get PDF
    The paper considers the communication complexity (measured in bits or real numbers) of Nash implementation of social choice rules. A key distinction is whether we restrict to the traditional one-stage mechanisms or allow multi-stage mechanisms. For one-stage mechanisms, the paper shows that for a large and important subclass of monotonic choice rules -- called "intersection monotonic" -- the total message space size needed for one-stage Nash implementation is essentially the same as that needed for "verification" (with honest agents who are privately informed about their preferences). According to Segal (2007), the latter is the size of the space of minimally informative budget equilibria verifying the choice rule. However, multi-stage mechanisms allow a drastic reduction in communication complexity. Namely, for an important subclass of intersection-monotonic choice rules (which includes rules based on coalitional blocking such as exact or approximate Pareto efficiency, stability, and envy-free allocations) we propose a two-stage Nash implementation mechanism in which each agent announces no more than two alternatives plus one bit per agent in any play. Such two-stage mechanisms bring about an exponential reduction in the communication complexity of Nash implementation for discrete communication measured in bits, or a reduction from infinite- to low-dimensional continuous communication.Monotonic social choice rules, Nash implementation, communication complexity,verification, realization, budget sets, price equilibria

    Message and time efficient multi-broadcast schemes

    Full text link
    We consider message and time efficient broadcasting and multi-broadcasting in wireless ad-hoc networks, where a subset of nodes, each with a unique rumor, wish to broadcast their rumors to all destinations while minimizing the total number of transmissions and total time until all rumors arrive to their destination. Under centralized settings, we introduce a novel approximation algorithm that provides almost optimal results with respect to the number of transmissions and total time, separately. Later on, we show how to efficiently implement this algorithm under distributed settings, where the nodes have only local information about their surroundings. In addition, we show multiple approximation techniques based on the network collision detection capabilities and explain how to calibrate the algorithms' parameters to produce optimal results for time and messages.Comment: In Proceedings FOMC 2013, arXiv:1310.459

    Models of Civil-Military Relationships at the Elite Level

    Full text link
    http://deepblue.lib.umich.edu/bitstream/2027.42/50840/1/58.pd

    Nonlinear thermal control in an N-terminal junction

    Full text link
    We demonstrate control over heat flow in an N-terminal molecular junction. Using simple model Hamiltonians we show that the heat current through two terminals can be tuned, switched, and amplified, by the temperature and coupling parameters of external gating reservoirs. We discuss two models: A fully harmonic system, and a model incorporating anharmonic interactions. For both models the control reservoirs induce thermal fluctuations of the transition elements between molecular vibrational states. We find that a fully harmonic model does not show any controllability, while for an anharmonic system the conduction properties of the junction strongly depend on the parameters of the gates. Realizations of the model system within nanodevices and macromolecules are discussed

    Mass Society and Non-Linear Development: A Study in Communication and Political Integration

    Full text link
    http://deepblue.lib.umich.edu/bitstream/2027.42/50827/1/43.pd

    Status Inconsistency, Cross Pressures, and American Political Behavior

    Full text link
    http://deepblue.lib.umich.edu/bitstream/2027.42/50825/1/41.pd
    corecore