Filters








15,837 Hits in 2.8 sec

Page 3 of Southern Rose Vol. 1, Issue 23 [page]

1833 Southern Rose  
ORLA POBUBYs THE TIGHT BOOTS, PAKT SECOND.  ...  So we started together, the boys looking on, My boots felt as tight as a vice ; 1 hobbled, and stumbled, just ready to fall, While Loring was off in a trice.  ... 

Measuring Majority Power and Veto Power of Voting Rules [article]

Aleksei Y. Kondratev, Alexander S. Nesterov
2019 arXiv   pre-print
We find tight bounds on these minimal shares for voting rules that are popular in the literature and real elections. We order these rules according to majority power and veto power.  ...  The instant-runoff voting has both the highest majority power and the highest veto power and the plurality rule has the lowest.  ...  Next we determine the tight bounds for the plurality with runoff and the Black's rule. Theorem 5.  ... 
arXiv:1811.06739v2 fatcat:ndnwqf2jvjgnfj4hacx6nvvyq4

Approximating Optimal Social Choice under Metric Preferences

Elliot Anshelevich, Onkar Bhardwaj, John Postl
2015 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We also give lower bounds on the distortion that could be obtained by any deterministic social choice mechanism, and extend our results on median agent cost to more general objective functions.  ...  Thus, we seek to bound the distortion: the worst-case ratio between the social cost of the alternative selected and the optimal alternative.  ...  Acknowledgments This work began as a project in a class taught by Lirong Xia, and we would like to thank him greatly for many interesting discussions on the topic of social choice.  ... 
doi:10.1609/aaai.v29i1.9308 fatcat:jdzfgcr3w5hbra7n7e72h7wapi

Simple Dynamics for Plurality Consensus [article]

Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan
2015 arXiv   pre-print
We then prove that our upper bound above is tight as long as k ≤ (n/ n)^1/4.  ...  It is assumed that the initial color configuration exhibits a sufficiently large bias s towards a fixed plurality color, that is, the number of nodes supporting the plurality color exceeds the number of  ...  We then show that our upper bound is tight for a wide range of the input parameters.  ... 
arXiv:1310.2858v3 fatcat:j7ce4p3yd5fpdlxzmcect5zng4

Page 311 of American Sportswear & Knitting Times Vol. 40, Issue 16 [page]

1971 American Sportswear & Knitting Times  
The pile yarn crosses one or more wales of ground fabric stitches between loops and is bound to at least one of the crossed wales by being laid into the stitches of the same without itself FOR LAMINATING  ...  Each portion comprises a plural- ity of wales, the loops of the obverse portion facing one side of the fabric and the loops of the reverse portion facing the other side of the fabric.  ... 

Distributed ranking in networks with limited memory and communication

Kyomin Jung, Bo Young Kim, Milan Vojnovic
2012 2012 IEEE International Symposium on Information Theory Proceedings  
We prove correctness of the algorithm with high probability as the number of nodes grows large for the case when each node communicates with any other node, and establish tight convergence time bounds.  ...  Then we introduce a simple and natural plurality selection algorithm for the selection over m > 1 items that uses only log 2 (m) + 1 bits of per-node memory and per pair-wise communication.  ...  We show that the bound is tight up to a constant factor by exhibiting the following lower bound.  ... 
doi:10.1109/isit.2012.6284710 dblp:conf/isit/JungKV12 fatcat:4crao2cnv5dubdzhl5rthtnbem

Randomized strategies for the plurality problem

Daniel Král', Jiří Sgall, Tomáš Tichý
2008 Discrete Applied Mathematics  
We give asymptotically tight bounds both for the case of two colors and many colors.  ...  For the balls colored by k colors, we prove a lower bound Ω(kn) on the expected number of questions; this is asymptotically optimal.  ...  We give asymptotically tight bounds both for the case of two colors and many colors.  ... 
doi:10.1016/j.dam.2008.05.014 fatcat:vhawr6a2mve6fcyikuyht42k54

Fishing out Winners from Vote Streams [article]

Arnab Bhattacharyya, Palash Dey
2015 arXiv   pre-print
and plurality with run off.  ...  We show non-trivial upper and lower bounds on the space complexity of -winner determination for several voting rules, including k-approval, k-veto, scoring rules, approval, maximin, Bucklin, Copeland,  ...  The lower bound is tight in the number of votes n. Theorem 20.  ... 
arXiv:1508.04522v2 fatcat:4b4swn4u4jbkdgmaew5dstmfg4

Simple dynamics for plurality consensus

Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan
2014 Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures - SPAA '14  
We prove a tight bound on the convergence time which grows as Θ(k log n) for a wide range of parameters k and n.  ...  The goal (of the agents) is to let the process converge to the stable configuration where all nodes support the plurality color.  ...  We then show that our upper bound is tight for a wide range of the input parameters.  ... 
doi:10.1145/2612669.2612677 dblp:conf/spaa/BecchettiCNPST14 fatcat:bk2ikk5a3bf6fekfh4ffsmleti

Simple dynamics for plurality consensus

Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan
2016 Distributed computing  
We prove a tight bound on the convergence time which grows as Θ(k log n) for a wide range of parameters k and n.  ...  The goal (of the agents) is to let the process converge to the stable configuration where all nodes support the plurality color.  ...  We then show that our upper bound is tight for a wide range of the input parameters.  ... 
doi:10.1007/s00446-016-0289-4 fatcat:flgrlghhzbgptdp6t336pvw7ai

VTV - A Voting Strategy for Real-Time Systems

Hüseyin Aysan, Sasikumar Punnekkat, Radu Dobrin
2008 2008 14th IEEE Pacific Rim International Symposium on Dependable Computing  
However, NMR primarily focuses on producing the correct value, without taking into account the time dimension.  ...  In this paper, we propose a new approach, Voting on Time and Value (VTV), applicable to real-time systems, which extends the modular redundancy approach by explicitly considering both value and timing  ...  This bound can be achieved by relatively inexpensive clock synchronization algorithms implemented in software (compared to expensive tight clock synchronization implementations).  ... 
doi:10.1109/prdc.2008.28 dblp:conf/prdc/AysanPD08 fatcat:m6vku5tvo5dnzcaqrtifawbbdq

Approval-Based Elections and Distortion of Voting Rules

Grzegorz Pierczyński, Piotr Skowron
2019 Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence  
It is often assumed that the optimal candidate is the one that minimizes the total distance to the voters.  ...  We determine acceptability-distortion for a number of rules, including Plurality, Borda, k-Approval, Veto, Copeland, Ranked Pairs, the Schulze's method, and STV.  ...  The bound obtained in Theorem 4.5 is not tight in general. For example, for Plurality we have a tighter estimation. Theorem 4.6. The ab-distortion of Plurality is m−1 m .  ... 
doi:10.24963/ijcai.2019/77 dblp:conf/ijcai/PierczynskiS19 fatcat:xrq774fwbrdkxbi5qwm3um7yta

Plurality Consensus in the Gossip Model [chapter]

L. Becchetti, A. Clementi, E. Natale, F. Pasquale, R. Silvestri
2014 Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms  
We prove that this upper bound is almost tight in the strong sense: Starting from any color configurationc, the convergence time is Ω(md(c)).  ...  All our bounds hold with high probability.  ...  Our analysis achieves almost-tight bounds on convergence time.  ... 
doi:10.1137/1.9781611973730.27 dblp:conf/soda/BecchettiCNPS15 fatcat:jm3o2pvwofcgfft367nufg5k2m

Plurality Consensus in the Gossip Model [article]

L. Becchetti, A. Clementi, E. Natale, F. Pasquale, R. Silvestri
2014 arXiv   pre-print
We prove that this upper bound is almost tight in the strong sense: Starting from any color configuration c̅, the convergence time is Ω(md(c̅)).  ...  All our bounds hold with high probability.  ...  Our analysis achieves almost-tight bounds on convergence time.  ... 
arXiv:1407.2565v2 fatcat:gbf2cjqsrbg4len6qo6erag4sy

Secondary Electron Emission by Plasmon Induced Symmetry Breaking in Highly Oriented Pyrolitic Graphite (HOPG) [article]

Wolfgang S.M. Werner, Vytautas Astašauskas, Philipp Ziegler, Alessandra Bellissimo, Giovanni Stefani, Lukas Linhart, Florian Libisch
2020 arXiv   pre-print
Interpretation of the results is performed on the basis of density functional theory and tight binding calculations.  ...  For higher energy losses plural plasmon excitation sets in.  ...  and of the momentum of the bound electron prior to its emission,q.  ... 
arXiv:2006.05413v1 fatcat:4uru7l3tqrclpf62dhybjuvzmu
« Previous Showing results 1 — 15 out of 15,837 results