Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Graphical Representation of Inequalities

Graphical Representation of Inequalities

The graph of the equation where y equals x squared forms a curve known as a parabola. This curve acts as a boundary in the coordinate plane, dividing it into distinct regions based on the relative position of points.When the equality sign in the equation is replaced with an inequality—such as greater than, less than, greater than or equal to, or less than or equal to—the graphical representation changes from a single curve into a broader shaded area that signifies the set of all...

Theorems of Pappus and Guldinus: Problem Solving

Theorems of Pappus and Guldinus: Problem Solving

Pappus and Guldinus's theorems are powerful mathematical principles that are used for finding the surface area and volume of composite shapes. For example, consider a cylindrical storage tank with a conical top. Finding the surface area or volume can be challenging for such complex shapes. These theorems are particularly useful in calculating the volume and surface area of such systems. Here, the cylindrical storage tank with a conical top can be broken down into two simple shapes: a...

Castigliano's Theorem: Problem Solving

Castigliano's Theorem: Problem Solving

The deflection of a simply supported beam that carries a central point load can be analyzed using structural mechanics principles, particularly by applying Castigliano's theorem. This theorem relates the displacement at the load application point to the partial derivatives of the strain energy in the structure. The simply supported beam with a point load at its center has symmetric reaction forces at the supports, each bearing half of the load. The bending moment at any point along the beam is...

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

Decision Making: P-value Method

Decision Making: P-value Method

The process of hypothesis testing based on the P-value method includes calculating the P- value using the sample data and interpreting it.
First, a specific claim about the population parameter is proposed. The claim is based on the research question and is stated in a simple form. Further, an opposing statement to the claim is also stated. These statements can act as null and alternative hypotheses: a null hypothesis would be a neutral statement while the alternative hypothesis can...

Fundamental Theorem of Algebra

Fundamental Theorem of Algebra

The Fundamental Theorem of Algebra is central to the study of polynomial equations, asserting that every non-constant polynomial with complex coefficients has at least one complex zero. This means that a polynomial of degree n ≥ 1, written as: with an ≠ 0, has at least one solution in the complex number system. Since the set of real numbers is a subset of complex numbers, this theorem applies equally to polynomials with real coefficients.Building on this result, the...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

On the correlation gap of matroids.

Mathematical programming·2025

Same journal

A better-than-1.6-approximation for prize-collecting TSP.

Mathematical programming·2026

Same journal

A <math><mrow><mfrac><mn>4</mn> <mn>3</mn></mfrac></mrow></math> -approximation for the maximum leaf spanning arborescence problem in DAGs.

Mathematical programming·2026

Same journal

An FPTAS for Connectivity Interdiction.

Mathematical programming·2026

Same journal

A first order method for linear programming parameterized by circuit imbalance.

Mathematical programming·2026

Same journal

Tight lower bounds for block-structured integer programs.

Mathematical programming·2026

Same journal

Accelerated first-order optimization under nonlinear constraints.

Mathematical programming·2026

See all related articles

Search research articles

Related Experiment Video

Updated: Dec 10, 2025

The HoneyComb Paradigm for Research on Collective Human Behavior

The HoneyComb Paradigm for Research on Collective Human Behavior

Published on: January 19, 2019

An efficient characterization of submodular spanning tree games.

Zhuan Khye Koh¹, Laura Sanità^2,3

¹Department of Mathematics, London School of Economics and Political Science, London, UK.

Mathematical Programming

|September 1, 2020

Summary

This summary is machine-generated.

This study provides a polynomial-time characterization for submodular instances of the spanning tree game. This resolves an open question in cooperative game theory, aiding in efficient allocation distribution.

Keywords:

05C05 Trees 05C57 Games on graphs (graph-theoretic aspects)91A12 Cooperative games

More Related Videos

The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm

The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm

Published on: October 20, 2022

New Variations for Strategy Set-shifting in the Rat

New Variations for Strategy Set-shifting in the Rat

Published on: January 23, 2017

Related Experiment Videos

Last Updated: Dec 10, 2025

The HoneyComb Paradigm for Research on Collective Human Behavior

The HoneyComb Paradigm for Research on Collective Human Behavior

Published on: January 19, 2019

The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm

The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm

Published on: October 20, 2022

New Variations for Strategy Set-shifting in the Rat

New Variations for Strategy Set-shifting in the Rat

Published on: January 23, 2017

Area of Science:

Game Theory
Algorithmic Game Theory
Combinatorial Optimization

Background:

Cooperative games involve distributing value among cooperating players (coalitions).
Submodularity (convexity) is a key property in cooperative games, simplifying allocation existence and computation.
Many prominent cooperative games, like the spanning tree game, are not inherently convex.

Purpose of the Study:

To address the open problem of efficiently characterizing submodular instances of the spanning tree game.
To develop a polynomial-time algorithm for recognizing submodular spanning tree games.

Main Methods:

Focuses on the fundamental spanning tree game, a widely studied cooperative game.
Develops a novel polynomial-time characterization for submodular instances within this game.

Main Results:

Successfully provides a polynomial-time characterization for submodular spanning tree games.
Resolves a previously open question in the literature regarding the efficient recognition of these game instances.

Conclusions:

The developed characterization enables efficient identification of submodular spanning tree games.
This advancement contributes to a better understanding and computational tractability of cooperative games with submodular properties.