Sciweavers

1193 search results - page 89 / 239
» A primer of simple theories
Sort
View
CSL
2009
Springer
15 years 6 months ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To
SAGT
2009
Springer
155views Game Theory» more  SAGT 2009»
15 years 6 months ago
Anarchy, Stability, and Utopia: Creating Better Matchings
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...
Elliot Anshelevich, Sanmay Das, Yonatan Naamad
SAGT
2009
Springer
176views Game Theory» more  SAGT 2009»
15 years 6 months ago
Bayesian Auctions with Friends and Foes
We study auctions whose bidders are embedded in a social or economic network. As a result, even bidders who do not win the auction themselves might derive utility from the auction,...
Po-An Chen, David Kempe
LICS
2007
IEEE
15 years 6 months ago
Environmental Bisimulations for Higher-Order Languages
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
CSL
2007
Springer
15 years 6 months ago
Typed Normal Form Bisimulation
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
Søren B. Lassen, Paul Blain Levy