5995 search results - page 110 / 1199 » Algorithmic Game Theory |
142
Voted
SODA
2010
ACM
16 years 28 days ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
107
Voted
STOC
2000
ACM
15 years 8 months ago
2000
ACM
149
Voted
AAAI
2007
15 years 5 months ago
2007
A team of agents is jointly able to achieve a goal if despite any incomplete knowledge they may have about the world or each other, they still know enough to be able to get to a g...
121
Voted
RP
2009
Springer
15 years 10 months ago
2009
Springer
We describe the class of games with opacity condition, as an adequate model for security aspects of computing systems. We study their theoretical properties, relate them to reachab...
138
Voted
FROCOS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...