Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Sums of Power01:22

Sums of Power

182
In definite integration, Riemann sums approximate the area under a curve by dividing it into subintervals and summing the areas of rectangles. When these approximations follow predictable numerical patterns, such as arithmetic or polynomial sequences, sum formulas offer a more efficient and accurate way to compute the result. In particular, the sum of consecutive integers, squares, and cubes plays an essential role in simplifying these calculations, especially when dealing with uniform...
182
Summation Notation01:25

Summation Notation

349
Sigma notation, also known as summation notation, provides a concise method for representing the sum of a sequence of terms that follow a regular pattern. It utilizes the uppercase Greek letter sigma (∑), A typical expression is:In this form, k the index of summation is 1, the starting value, and n the ending value. The term ak​ represents the general term of the sequence.For example, the increasing sequence 5, 7, 9, ..., 23 over 10 terms can be expressed as:This simplifies the...
349
Area Problem01:26

Area Problem

258
Determining the area of a region with straight edges is straightforward, as geometric formulas for rectangles, triangles, and polygons can be applied directly. However, traditional geometric methods are insufficient when a region has a curved boundary, such as the area under a function.fromThe area problem involves finding a systematic way to measure such regions. One approach to solving this problem is through approximation. Instead of attempting to compute the area exactly at the outset, the...
258
Sum and Difference OpAmps01:22

Sum and Difference OpAmps

1.6K
Operational amplifiers (op-amps) are versatile devices that extend beyond amplification. In this context, two specific op-amp configurations are explored: the summing and difference amplifiers.
A summing amplifier, or an adder, utilizes an op-amp to merge multiple input signals into a single output signal. When audio signals are introduced into its input channels, the input resistors initiate currents that traverse feedback resistors, resulting in an output voltage. Applying Kirchhoff's current...
1.6K
Superposition Theorem01:18

Superposition Theorem

2.0K
The superposition principle is a fundamental concept stating that in a linear circuit, the voltage across (or current through) an element can be determined by summing the individual contributions of each independent source acting in isolation. When dealing with linear circuits containing multiple independent sources, this principle serves as a valuable tool for analysis. To apply the superposition principle effectively, one should focus on a single independent source at a time while...
2.0K
Area Between Curves: Problem Solving01:27

Area Between Curves: Problem Solving

179
A region can be enclosed by three curves: a square root function, a reflected cube root function, and a linear function. The linear function intersects each of the other two curves, and these intersection points determine where the boundary of the enclosed region changes. Because different curves serve as the upper and lower boundaries in different parts of the graph, the area cannot be found using a single setup over the entire interval.To compute the area, the region is first divided into two...
179

You might also read

Related Articles

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

Sort by
Same author

Generating subtour elimination constraints for the TSP from pure integer solutions.

Central European journal of operations research·2017
Same author

Erratum: Pferschy-Wenzig, E.-M.; et al. Does a Graphical Abstract Bring More Visibility to Your Paper? Molecules 2016, 21, 1247.

Molecules (Basel, Switzerland)·2016
Same author

Proportional Borda allocations.

Social choice and welfare·2016
Same author

Does a Graphical Abstract Bring More Visibility to Your Paper?

Molecules (Basel, Switzerland)·2016
Same author

It is difficult to tell if there is a Condorcet spanning tree.

Mathematical methods of operations research (Heidelberg, Germany)·2016
Same author

How hard is it to tell which is a Condorcet committee?

Mathematical social sciences·2015

Related Experiment Video

Updated: Apr 15, 2026

SUMO-Binding Entities SUBEs as Tools for the Enrichment, Isolation, Identification, and Characterization of the SUMO Proteome in Liver Cancer
08:29

SUMO-Binding Entities SUBEs as Tools for the Enrichment, Isolation, Identification, and Characterization of the SUMO Proteome in Liver Cancer

Published on: November 1, 2019

7.7K

The Subset Sum game.

Andreas Darmann1, Gaia Nicosia2, Ulrich Pferschy3

  • 1University of Graz, Institute of Public Economics, Universitaetsstr. 15, A-8010 Graz, Austria.

European Journal of Operational Research
|April 7, 2015
PubMed
Summary

This study introduces a game theory approach to the Subset Sum problem where agents compete for knapsack capacity. Finding optimal item selection is NP-hard, prompting heuristic strategies for competitive resource allocation.

Keywords:
Game theoryMulti-agent optimizationPerformance analysisSubset Sum problem

More Related Videos

Qualitative and Quantitative Validation of Tools with Rating Scales Aimed at Assessing the Quality of University Service-Learning
10:39

Qualitative and Quantitative Validation of Tools with Rating Scales Aimed at Assessing the Quality of University Service-Learning

Published on: August 29, 2025

1.3K
Setting Limits on Supersymmetry Using Simplified Models
07:46

Setting Limits on Supersymmetry Using Simplified Models

Published on: November 15, 2013

9.0K

Related Experiment Videos

Last Updated: Apr 15, 2026

SUMO-Binding Entities SUBEs as Tools for the Enrichment, Isolation, Identification, and Characterization of the SUMO Proteome in Liver Cancer
08:29

SUMO-Binding Entities SUBEs as Tools for the Enrichment, Isolation, Identification, and Characterization of the SUMO Proteome in Liver Cancer

Published on: November 1, 2019

7.7K
Qualitative and Quantitative Validation of Tools with Rating Scales Aimed at Assessing the Quality of University Service-Learning
10:39

Qualitative and Quantitative Validation of Tools with Rating Scales Aimed at Assessing the Quality of University Service-Learning

Published on: August 29, 2025

1.3K
Setting Limits on Supersymmetry Using Simplified Models
07:46

Setting Limits on Supersymmetry Using Simplified Models

Published on: November 15, 2013

9.0K

Area of Science:

  • Operations Research
  • Game Theory
  • Computer Science

Background:

  • The classical Subset Sum problem involves selecting items to reach a target sum.
  • Resource allocation problems often involve competitive decision-making.
  • Knapsack capacity constraints are common in optimization challenges.

Purpose of the Study:

  • To analyze a game theoretic variant of the Subset Sum problem with competing agents.
  • To investigate optimal and heuristic strategies for resource allocation under knapsack constraints.
  • To adapt existing Subset Sum approximation algorithms for multi-agent scenarios.

Main Methods:

  • Formulating the problem as a two-agent game with a shared knapsack capacity.
  • Proving the NP-hardness of finding an optimal item selection sequence for a single agent.
  • Developing and analyzing two heuristic strategies against optimal and greedy opponents.
  • Exploring centralized perspectives and adapting classical Subset Sum approximation techniques.

Main Results:

  • The problem of finding an optimal item selection strategy is shown to be NP-hard.
  • Worst-case performance analyses of heuristic strategies are provided for different opponent behaviors.
  • Adaptability of classical Subset Sum approximation results to the multi-agent context is demonstrated.

Conclusions:

  • The multi-agent Subset Sum problem presents significant computational complexity.
  • Heuristic strategies offer practical approaches for competitive resource allocation.
  • Existing approximation algorithms can be extended to address multi-agent resource competition.