scholarly journals Voting in multi-stage elimination contests: Evidence from a Karaoke show

2021 ◽  
Author(s):  
Ashley Durán ◽  
Cesar Mantilla
Keyword(s):  
Strategic Voting ◽  
Trade Off ◽  
Multi Stage ◽  
Top Performers ◽  
Voting Decisions

We employ the data from a karaoke contest to analyze strategic voting. Participants face a trade-off when voting for the contestant they want to eliminate. Excluding worst-performers increases the size of the prize allocated to the winner, whereas excluding top-performers increases the chances to become the winner. We analyze the performance and voting decisions and justifications of 138 participants in this contest across 23 episodes. We find that votes for worst-performers are much more common than votes for top-performers, and the justifications for voting due to the competitors' mistakes are the most prominent. Although contestants are not informed of the performance of themselves or any other participant, the likelihood to vote for the worst-performer is higher than the probability of randomly voting for someone else.

scholarly journals A LEXICOGRAPHIC OPTIMIZATION APPROACH FOR BERTH SCHEDULE RECOVERY PROBLEM IN CONTAINER TERMINALS

Transport ◽  
2016 ◽  
Vol 31 (1) ◽  
pp. 76-83 ◽  
Author(s):  
Qian Zhang ◽  
Qingcheng Zeng ◽  
Hualong Yang
Keyword(s):  
Container Terminals ◽  
Optimization Approach ◽  
Technical Problems ◽  
Trade Off ◽  
Practical Applications ◽  
Lexicographic Optimization ◽  
Multi Stage ◽  
Schedule Recovery ◽  
Equipment Failures ◽  
Recovery Problem

In container terminals, the planned berth schedules often have to be revised because of disruptions caused by severe weather, equipment failures, technical problems and other unforeseen events. In this paper, the problem of berth schedule recovery is addressed to reduce the influences caused by disruptions. A multi-objective, multi-stage model is developed considering the characteristics of different customers and the trade-off of all parties involved. An approach based on the lexicographic optimization is designed to solve the model. Numerical experiments are provided to illustrate the validity of the proposed Model A and algorithms. Results indicate that the designed Model A and algorithm can tackle the berth plan recovery problem efficiently because the beneficial trade-off among all parties involved are considered. In addition, it is more flexible and feasible with the aspect of practical applications considering that the objective order can be adjusted by decision makers.

Testing legislative shirking in a new setting: the case of lame duck sessions in the Korean National Assembly

2018 ◽  
Vol 20 (1) ◽  
pp. 33-52
Author(s):  
Bon Sang Koo ◽  
Junseok Kim ◽  
Jun Young Choi
Keyword(s):  
Political Parties ◽  
South Korea ◽  
Leisure Time ◽  
Trade Off ◽  
National Assembly ◽  
Hurdle Models ◽  
Voting Participation ◽  
Lame Duck ◽  
Voting Decisions ◽  
New Democracy

AbstractThis paper aims to test two types of legislative shirking in a new democracy, South Korea. Using the lame-duck sessions of the Korean National Assembly, we test whether a legislator shirks in voting participation and in voting decisions. We weave two competing motivations of legislative shirking in voting participation – that to secure more leisure time and that to utilize the last, valuable voting opportunity – into a synthetic hypothesis and test it with two-part hurdle models. To test a shirking in voting participation hypothesis, we analyze legislators’ choices on bills that are supposedly related to the interests of constituents or political parties. Empirical results strongly support our shirking in voting participation claims, while only partial evidence is found on shirking in voting decisions. The findings suggest that, besides the trade-off between labor and leisure, some legislators deem the lame-duck sessions an opportunity to express their own preferences unconstrained.

History-dependence in production-pollution-trade-off models: a multi-stage approach

2013 ◽  
Vol 222 (1) ◽  
pp. 457-481 ◽  
Author(s):  
Elke Moser ◽  
Andrea Seidl ◽  
Gustav Feichtinger
Keyword(s):  
History Dependence ◽  
Trade Off ◽  
Multi Stage

A Flow-Preserving Algorithm for the Time-Cost Trade-Off Problem

1982 ◽  
Vol 14 (2) ◽  
pp. 109-113 ◽  
Author(s):  
Suleyman Tufekci
Keyword(s):  
Time Cost ◽  
Trade Off

Dual Goals for Speed and Accuracy on the Same Performance Task

2012 ◽  
Vol 11 (3) ◽  
pp. 118-126 ◽  
Author(s):  
Olive Emil Wetter ◽  
Jürgen Wegge ◽  
Klaus Jonas ◽  
Klaus-Helmut Schmidt
Keyword(s):  
Memory Scanning ◽  
Performance Task ◽  
Performance Tasks ◽  
Trade Off ◽  
Test Experiment ◽  
Trade Offs ◽  
New Finding ◽  
Sternberg Paradigm ◽  
Speed Accuracy ◽  
Speed And Accuracy

In most work contexts, several performance goals coexist, and conflicts between them and trade-offs can occur. Our paper is the first to contrast a dual goal for speed and accuracy with a single goal for speed on the same task. The Sternberg paradigm (Experiment 1, n = 57) and the d2 test (Experiment 2, n = 19) were used as performance tasks. Speed measures and errors revealed in both experiments that dual as well as single goals increase performance by enhancing memory scanning. However, the single speed goal triggered a speed-accuracy trade-off, favoring speed over accuracy, whereas this was not the case with the dual goal. In difficult trials, dual goals slowed down scanning processes again so that errors could be prevented. This new finding is particularly relevant for security domains, where both aspects have to be managed simultaneously.

Sign in / Sign up

Export Citation Format

Share Document