894 search results - page 99 / 179 » Game Theory with Costly Computation |
119
click to vote
ANSOFT
1998
15 years 1 months ago
1998
Programmes in “Software Engineering” have become a source of contention in many universities. Computer Science departments, many of which have used that phrase to describe ind...
100
click to vote
DM
2008
15 years 2 months ago
2008
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
121
click to vote
ISPDC
2005
IEEE
15 years 7 months ago
2005
IEEE
An important scheduling problem is the one in which there are no dependencies between tasks and the tasks can be of arbitrary size. This is known as the divisible load scheduling ...
134
click to vote
SAGT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. A mechanism is manipulable if it is in some agents’ best interest to misrepresent their private information. The revelation principle establishes that, roughly, anythin...
126
click to vote
COLT
2005
Springer
15 years 3 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...