Sciweavers

1653 search results - page 240 / 331
» Computer science and game theory
Sort
View
LICS
2006
IEEE
15 years 5 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
15 years 4 months ago
Multi-unit auctions with budget-constrained bidders
We study a multi-unit auction with multiple bidders, each of whom has a private valuation and a budget. The truthful mechanisms of such an auction are characterized, in the sense ...
Christian Borgs, Jennifer T. Chayes, Nicole Immorl...
79
Voted
ICALP
2005
Springer
15 years 4 months ago
Up-to Techniques for Weak Bisimulation
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...
Damien Pous
RELMICS
2005
Springer
15 years 4 months ago
Control-Flow Semantics for Assembly-Level Data-Flow Graphs
Abstract. As part of a larger project, we have built a declarative assembly language that enables us to specify multiple code paths to compute particular quantities, giving the ins...
Wolfram Kahl, Christopher Kumar Anand, Jacques Car...
SIGECOM
2003
ACM
119views ECommerce» more  SIGECOM 2003»
15 years 4 months ago
Preference elicitation in proxied multiattribute auctions
We consider the problem of minimizing preference elicitation in efficient multiattribute auctions, that support dynamic negotiation over non-price based attributes such as qualit...
Aditya V. Sunderam, David C. Parkes