Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Magnus Wahlstrm
Information about the author Magnus Wahlstrm will soon be added to the site.
Found
3 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis
2016
The Workflow Satisfiability Problem (WSP) asks whether there exists an assignment of...
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem
2016
The workflow satisfiability problem ( wsp ) is a problem of practical interest that...
Parameterized Two-Player Nash Equilibrium
2013
We study the problem of computing Nash equilibria in a two‐player normal form...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
