Search Results

How to Optimally Design Contests in Development Settings for Rapid and Efficient Results:

Firms increasingly leverage their expert suppliers to develop innovative products and services while minimizing both time-to-market and expenses. In “Dynamic ...

Public, private, and not-for-profit organizations find advanced technology and product development projects challenging to manage due to the time and budget pressures, and turn to their development partners and suppliers to address their development ...

Let T=(V,A) be a tournament with a nonnegative integral weight w(e) on each arc e. A subset F of arcs is called a feedback arc set (FAS) if T\F contains no cycles (directed). A collection F of FASs (with repetition allowed) is called an FAS packing if each arc e is ...

The International Chess Federation (FIDE) imposes a voluminous and complex set of player pairing criteria in Swiss-system chess tournaments and endorses computer programs that are able to calculate the prescribed pairings. The purpose of these ...

Crowdsourcing using innovation contests has become a popular tool to source innovative solutions to various problems organizations face. With several innovation contests that run in parallel, two key questions are how the number of contests affects ...

We study multiple parallel contests in which contest organizers elicit solutions to innovation-related problems from a set of solvers. Each solver may participate in multiple contests and exert effort to improve the solution for each contest the solver ...

Problem definition: Most industrial innovations consist of multiple interacting components that must be combined into a final product to form an integrated system. When procuring such complex innovations from their suppliers, buyers face a substantial ...

Problem definition : We study the contest duration and the award scheme of an innovation contest where an organizer elicits solutions to an innovation-related problem from a group of agents. Academic/practical relevance : Our interviews with practitioners ...

A tournament is a directed graph T such that every pair of vertices is connected by an arc. A feedback vertex set is a set S of vertices in T such that T − S is acyclic. We consider the Feedback Vertex Set problem in tournaments. Here, the input is a ...

We define a new inconsistency index for tournament matrices and two tournaments-based indices for multiplicative pairwise comparison matrices. We compare them with the index defined by Kulakowski and illustrate the fundamental differences on ...

This study experimentally investigates gender quotas in light of peer review. We investigate competitions with and without gender quotas and a peer review process that allows for sabotage. Our findings show that the possibility of peer sabotage renders ...

In a contest in which solvers with heterogeneous expertise exert effort to develop solutions, a recent paper [Terwiesch C, Xu Y 2008 Innovation contests, open innovation, and multiagent problem solving. Management Sci. 549:1529-1543] argues that as more ...

In an innovation tournament, an organizer solicits innovative ideas from a number of independent agents. Agents exert effort to develop their solutions, but their outcomes are unknown due to technical uncertainty and/or subjective evaluation criteria. ...

We consider voting rules that are based on the majority graph. Such rules typically output large sets of winners. Our goal is to investigate a general method which leads to refinements of such rules. In particular, we use the idea of parallel universes, ...

In 2009, Bang-Jensen asked whether there exists a function $g(k)$ such that every strongly $k$-connected $n$-vertex tournament contains a strongly $k$-connected spanning subgraph with at most $kn + g(k)$ arcs. In this paper, we answer the question by ...

We show that if $T$ is a strongly $10^9k^6\log(2k)$-connected tournament, there exists a partition $A,B$ of $V(T)$ such that each of $T[A]$, $T[B]$, and $T[A,B]$ is strongly $k$-connected. This provides solutions to tournament analogues of two partition ...

This article introduces new methods for ranking alternatives in multicriteria decision making situations. Each is based on the normative position that the strength of an alternative is inversely related to the number of alternatives that could prevent ...

We investigate the differences between groups and individuals in newsvendor ordering behavior by a laboratory experiment under the tournament competitive environment. We also study the association between newsvendor decision making and the decision-...

Let U5 be the tournament with vertices v1, ', v5 such that v2ï v1, and viï vj if j-iï 1, 2mod5 and {i,j}ï {1,2}. In this article, we describe the tournaments that do not have U5 as a subtournament. Specifically, we show that if a tournament G is "prime"-...

A central challenge in social choice theory arises from the fact that there is no fair way to deterministically select a winner in an election among more than two candidates; the only definite collective preferences are between individual pairs of ...

A message adversary is a daemon that suppresses messages in round-based message-passing synchronous systems in which no process crashes. A property imposed on a message adversary defines a subset of messages that cannot be eliminated by the adversary. ...

Recent results in experimental and personnel economics indicate that women do not like competitive environments as much as men. This paper presents an experimental design that gives participants the opportunity to enter a tournament as part of a team ...