Sciweavers

904 search results - page 119 / 181
» Game Theory
Sort
View
KI
2008
Springer
15 years 2 months ago
Simplest Scenario for Mutual Nested Modeling in Human-Machine-Interaction
The research aim of this paper is to represent everydaylife patterns of thought like "Because I know, what you think I think ..." by a process on a machine, which is inv...
Rustam Tagiew
IAT
2009
IEEE
15 years 1 months ago
Strategic Ability Update: A Modal Logic Account
We study an update operator for Coalition Logic to talk about the way players' strategic ability changes because of the moves of their opponents. We show its connection with D...
Jan Broersen, Rosja Mastop, John-Jules Ch. Meyer, ...
132
Voted
JUCS
2010
133views more  JUCS 2010»
14 years 10 months ago
From Computing Sets of Optima, Pareto Sets, and Sets of Nash Equilibria to General Decision-Related Set Computations
: Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set ...
Vladik Kreinovich, Bartlomiej Jacek Kubica
APSEC
2007
IEEE
15 years 10 months ago
Incentive Compatible Mechanisms for Group Ticket Allocation in Software Maintenance Services
A customer reported problem (or Trouble Ticket) in software maintenance is typically solved by one or more maintenance engineers. The decision of allocating the ticket to one or m...
Karthik Subbian, Ramakrishnan Kannan, Raghav Kumar...
160
Voted
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
15 years 2 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg