Submodularity helps in Nash and nonsymmetric bargaining games (Q4979826)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Submodularity helps in Nash and nonsymmetric bargaining games |
scientific article; zbMATH DE number 6305440
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Submodularity helps in Nash and nonsymmetric bargaining games |
scientific article; zbMATH DE number 6305440 |
Statements
Submodularity Helps in Nash and Nonsymmetric Bargaining Games (English)
0 references
19 June 2014
0 references
Nash bargaining
0 references
submodularity
0 references
convex programs
0 references
0.7954029440879822
0 references
0.781103253364563
0 references
0.7671022415161133
0 references
0.7638458013534546
0 references
0.7624232172966003
0 references
