1688 search results - page 12 / 338 » The Complexity of Rationalizing Matchings |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
ISAAC
2001
Springer
14 years 3 days ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
JDS
2006
13 years 7 months ago
2006
The concept of "agent" has been used to describe many different artefacts: software programs, mobile robots, or even human beings. In a system consisting of many agents, ...
SAGT
2009
Springer
14 years 2 months ago
2009
Springer
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift-invariant signal dictionari...