Sciweavers

85 search results - page 1 / 17
» Applications of approximation algorithms to cooperative game...
Sort
View
62
Voted
STOC
2001
ACM
153views Algorithms» more  STOC 2001»
15 years 10 months ago
Applications of approximation algorithms to cooperative games
Kamal Jain, Vijay V. Vazirani
97
Voted
ATAL
2010
Springer
14 years 10 months ago
Monotone cooperative games and their threshold versions
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...
Haris Aziz, Felix Brandt, Paul Harrenstein
82
Voted
AAAI
2008
14 years 12 months ago
Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
ATAL
2008
Springer
14 years 11 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
14 years 9 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna