5 search results - page 1 / 1 » Linear Programming Polytope and Algorithm for Mean Payoff Ga... |
AAIM
2006
Springer
13 years 8 months ago
2006
Springer
We investigate LP-polytopes generated by mean payoff games and their properties, including the existence of tight feasible solutions of bounded size. We suggest a new associated al...
VALUETOOLS
2006
ACM
13 years 10 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
IAT
2007
IEEE
13 years 11 months ago
2007
IEEE
The agents in multiagent systems can coordinate their actions and handle tasks jointly by forming coalitions. One of the important steps in this process is the fair division of pa...
ICALP
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
COLING
2010
12 years 11 months ago
2010
We present a novel Evaluation Metric for Morphological Analysis (EMMA) that is both linguistically appealing and empirically sound. EMMA uses a graphbased assignment algorithm, op...