Constraint games for stable and optimal allocation of demands in SDN

DOI10.1007/s10601-019-09303-zzbMath1480.90174OpenAlexW2957712016WikidataQ127401544 ScholiaQ127401544MaRDI QIDQ2009195

Anthony Palmieri, Arnaud Lallouet, Luc Pons

Publication date: 27 November 2019

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-019-09303-z

zbMATH Keywords

optimizationgame theorycolumn generationinteger linear programmingconstraint programmingmulticommodity flowSDN

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Applications of game theory (91A80) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• SNDlib
• CPLEX
• AIMMS
• ACTS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contractor programming
• Constraint models for the covering test problem
• Energy-efficient service function chain provisioning
• Solving a network design problem
• A network pricing game for selfish traffic
• Cost-based filtering for shorter path constraints
• Non-cooperative games
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• A survey of combinatorial testing
• Algorithms for the Multi-constrained Routing Problem
• Fast, Fair, and Efficient Flows in Networks
• Multiagent Systems
• Competitive Online Multicommodity Routing
• Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
• Selfish Routing in Capacitated Networks
• The Price of Routing Unsplittable Flow
• Principles and Practice of Constraint Programming – CP 2004