Sciweavers

79 search results - page 6 / 16
» Deliberation in Equilibrium: Bargaining in Computationally C...
Sort
View
TCS
2008
14 years 9 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
ATAL
2007
Springer
15 years 3 months ago
A computational characterization of multiagent games with fallacious rewards
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
Ariel D. Procaccia, Jeffrey S. Rosenschein
WINE
2005
Springer
206views Economy» more  WINE 2005»
15 years 3 months ago
Exchange Market Equilibria with Leontief's Utility: Freedom of Pricing Leads to Rationality
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...
Yinyu Ye
ECAI
2004
Springer
15 years 3 months ago
Focusing Reasoning Through Emotional Mechanisms
Abstract. In concrete environments, where uncertainty and dynamism are pervasive and time and resources are limited, reasoning and decision-making processes raise important problem...
Luís Morgado, Graça Gaspar
STOC
2005
ACM
142views Algorithms» more  STOC 2005»
15 years 10 months ago
Market equilibrium via the excess demand function
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
Bruno Codenotti, Benton McCune, Kasturi R. Varadar...