Sciweavers

108 search results - page 5 / 22
» Computational Methods for Oblivious Equilibrium
Sort
View
PRIMA
2007
Springer
15 years 3 months ago
Multiagent Planning with Trembling-Hand Perfect Equilibrium in Multiagent POMDPs
Multiagent Partially Observable Markov Decision Processes are a popular model of multiagent systems with uncertainty. Since the computational cost for finding an optimal joint pol...
Yuichi Yabu, Makoto Yokoo, Atsushi Iwasaki
EUROCRYPT
1995
Springer
15 years 1 months ago
Quantum Oblivious Mutual Identification
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
Claude Crépeau, Louis Salvail
ANOR
2005
80views more  ANOR 2005»
14 years 9 months ago
Entropic Penalties in Finite Games
The main objects here are finite-strategy games in which entropic terms are subtracted from the payoffs. After such subtraction each Nash equilibrium solves an explicit, unconstra...
Sjur Didrik Flåm, E. Cavazzuti
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
15 years 10 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
15 years 4 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna