Sciweavers

278 search results - page 4 / 56
» Quantitative Fairness Games
Sort
View
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
14 years 11 months ago
Quantitative stochastic parity games
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
ACSAC
2003
IEEE
15 years 3 months ago
Security Design in Online Games
The emergence of online games has fundamentally changed security requirements for computer games, which previously were largely concerned with copy protection. In this paper, we e...
Jeff Jianxin Yan
SAGT
2010
Springer
223views Game Theory» more  SAGT 2010»
14 years 8 months ago
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games
Abstract. Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda....
Vittorio Bilò, Ioannis Caragiannis, Angelo ...
AAAI
2012
13 years 14 days ago
Computing the Nucleolus of Matching, Cover and Clique Games
In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable sol...
Ning Chen, Pinyan Lu, Hongyang Zhang
CAV
2009
Springer
155views Hardware» more  CAV 2009»
15 years 10 months ago
Better Quality in Synthesis through Quantitative Objectives
Abstract. Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another....
Roderick Bloem, Krishnendu Chatterjee, Thomas A. H...