2766 search results - page 255 / 554 » Algorithms for trigonometric polynomials |
155
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is ( ...
139
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
135
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
137
click to vote
LATIN
2010
Springer
16 years 11 days ago
2010
Springer
Given a set S of segments in the plane, a polygon P is an intersecting polygon of S if every segment in S intersects the interior or the boundary of P. The problem MPIP of computi...
164
click to vote
COCO
2009
Springer
16 years 3 days ago
2009
Springer
This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement...