Sciweavers

399 search results - page 12 / 80
» Games with Congestion-Averse Utilities
Sort
View
TARK
1998
Springer
14 years 1 months ago
Conditional, Hierarchical, Multi-Agent Preferences
We develop a revealed-preferencetheory for multiple agents. Some features of our construction, which draws heavily on Jeffrey's utility theory and on formal constructions by D...
Pierfrancesco La Mura, Yoav Shoham
PERCOM
2008
ACM
14 years 9 months ago
A Novel Utility and Game-Theoretic Based Security Mechanism for Mobile P2P Systems
Research on security in Peer-to-Peer (P2P) systems is dominated by reputation-based solutions. These solutions propagate opinions about other peers in order to help identify the b...
Brent Lagesse, Mohan Kumar
UAI
2004
13 years 11 months ago
Computing Nash Equilibria of Action-Graph Games
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
Navin A. R. Bhat, Kevin Leyton-Brown
AAAI
2010
13 years 9 months ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman
CG
2004
Springer
14 years 1 months ago
Locally Informed Global Search for Sums of Combinatorial Games
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
Martin Müller 0003, Zhichao Li