Sciweavers

2025 search results - page 269 / 405
» Theory as Game: Designing the Game Game
Sort
View
CN
2006
95views more  CN 2006»
15 years 6 months ago
Generalized Nash Bargaining Solution for bandwidth allocation
For over a decade, the Nash Bargaining Solution (NBS) concept from cooperative game theory has been used in networks to share resources fairly. Due to its many appealing propertie...
Corinne Touati, Eitan Altman, Jérôme ...
IAT
2009
IEEE
15 years 4 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, ...
JUCS
2010
133views more  JUCS 2010»
15 years 1 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
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
16 years 1 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
ATAL
2009
Springer
16 years 29 days ago
Pragmatic-strategic reputation-based decisions in BDI agents
Computational trust and reputation models have been recognized as one of the key technologies required to design and implement agent systems. These models manage and aggregate the...
Isaac Pinyol, Jordi Sabater-Mir