In a party-based election voters are grouped into parties and the voters belonging to the same party are assumed to cast their votes according to the fixed party preference over the set of candidates. For such elections, we investigate the complexity of the following problem: can we make some distinguished candidate win (or lose) the election by bribing at most k voters to switch from their ori...

Cheryl H Arrowsmith, James E Audia, Christopher Austin, Jonathan Baell, Jonathan Bennett, Julian Blagg, Chas Bountra, Paul E Brennan, Peter J Brown, Mark E Bunnage, Carolyn Buser-Doepner, Robert M Campbell, Adrian J Carter, Philip Cohen, Robert A Copeland, Ben Cravatt, Jayme L Dahlin, Dashyant Dhanak, Aled M Edwards, Mathias Frederiksen, Stephen V Frye, Nathanael Gray, Charles E Grimshaw, David...

Bu çalışmada, Borsa İstanbul (BIST) Kimya, Petrol Kauçuk ve Plastik Ürünler sektöründeki firmaların finansal performansının Çok Kriterli Karar Verme (ÇKKV) yöntemi ile ölçülmesi amaçlanmıştır. doğrultuda, 39 firmanın 2021 yılı performansı belirlenen oranlar temelinde Simultaneous Evaluation of Criteria and Alternative (SECA) ölçülmüştür. SECA kriterlerin ağırlıkları alternatiflerin performans s...

Under 5 years . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 6.2 5 to 9 years . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 10.0 10 to 14 years . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 10.3 15 to 19 years . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 10.9 20 to 24 years . . . . . . . . . . . . . . . . . . . . . ...

We describe a simple computing technique for the tournament choice problem. It rests upon a relational modeling and uses the BDD-based computer system RelView for the evaluation of the relationalgebraic expressions that specify the solutions and for the visualization of the computed results. The Copeland set can immediately be identified using RelView’s labeling feature. Relation-algebraic spec...

The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computational considerations; the goal is to design voting rules that are computationally hard, in the worst-case, to manipulate. However, recent work indicates that the prominent voting rules are usually easy to manipulate. ...

This paper studies organizational change following a shift in an industry environment, in the context of how a focused factory adapts to a change in its manufacturing objectives. We use the organizational nature of production operations to suggest that the effectiveness of adaptation will depend on how well the manufacturing requirements of the new objectives match manufacturing capabilities at...

Computers today are not only the calculation tools they are directly (inter)acting in the physical world which itself may be conceived of as the universal computer (Zuse, Fredkin, Wolfram, Chaitin, Lloyd). In expanding its domains from abstract logical symbol manipulation to physical embedded and networked devices, computing goes beyond Church-Turing limit (Copeland, Siegelman, Burgin, Schachte...

In many real world elections, agents are not required to rank all candidates. We study three of the most common methods used to modify voting rules to deal with such partial votes. These methods modify scoring rules (like the Borda count), elimination style rules (like single transferable vote) and rules based on the tournament graph (like Copeland) respectively. We argue that with an eliminati...

RECOVERY OF DOGS UNDERGOING ORTHOPEDIC SURGERY by JENNIFER ELIZABETH COPELAND (Under the Direction of ERIK HOFMEISTER) ABSTRACT Recovery is an important part of the anesthetic episode, as monitoring is not as focused and complications can arise. This study investigated if there was a difference between the quality of recovery between induction with propofol or ketamine/diazepam. Dogs undergoing...