5995 search results - page 785 / 1199 » Algorithmic Game Theory |
189
click to vote
SIAMCOMP
2010
15 years 5 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
190
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
354
click to vote
SIGECOM
2011
ACM
14 years 9 months ago
2011
ACM
Market making refers broadly to trading strategies that seek to profit by providing liquidity to other traders, while avoiding accumulating a large net position in a stock. In th...
212
click to vote
ATAL
2011
Springer
14 years 6 months ago
2011
Springer
We consider a setting in which a principal seeks to induce an adaptive agent to select a target action by providing incentives on one or more actions. The agent maintains a belief...
225
click to vote
MOBICOM
2012
ACM
13 years 9 months ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...