2477 search results - page 96 / 496 » Approximate extended formulations |
119
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
146
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
141
click to vote
LATIN
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
132
click to vote
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
186
click to vote
DCG
2010
15 years 4 months ago
2010
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...