New Math Tool Solves Complex Negotiations Faster
This could help set fair prices and allocate resources more efficiently.
Researchers introduce a branch-and-cut algorithm for mixed-integer Nash equilibrium problems, where each player solves a mixed-integer optimization problem parameterized by rivals’ strategies. It covers standard NEPs, where parameterization acts only on cost functions, and generalized NEPs, where strategy spaces may also depend on rivals’ strategies.
On termination, the algorithm either computes a pure Nash equilibrium or decides none exists. The method uses a bilevel reformulation based on the Nikaido–Isoda function, a tractable relaxation, and a branch-and-cut framework, with sufficient conditions for suitable cuts and finite termination depending on the setting.
For GNEPs, it adapts intersection cuts and adds a fallback strategy that fixes recurring integer profiles; for NEPs, best-response inequalities provide suitable cuts. Numerical results show the tailored branch-and-cut method outperforms directly applying the state-of-the-art bilevel solver MibS on the tested integer and generalized knapsack instances.
- The algorithm solves games where players make both discrete and continuous choices.
- It outperformed a leading solver on tested examples, finding stable outcomes faster.
- It works best when players' objectives have certain mathematical properties, like concavity.
Why It Matters
Faster solutions to complex games could lead to fairer prices and better resource allocation in markets.