Sciweavers

267 search results - page 7 / 54
» Online Auctions: There Can Be Only One
Sort
View
AAAI
2010
15 years 1 months ago
Efficient Belief Propagation for Utility Maximization and Repeated Inference
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
Aniruddh Nath, Pedro Domingos
ACNS
2010
Springer
132views Cryptology» more  ACNS 2010»
15 years 3 months ago
Efficient Implementation of the Orlandi Protocol
Abstract. We present an efficient implementation of the Orlandi protocol which is the first implementation of a protocol for multiparty computation on arithmetic circuits, which is...
Thomas P. Jakobsen, Marc X. Makkes, Janus Dam Niel...
102
Voted
ECAI
2010
Springer
15 years 26 days ago
An Equilibrium Analysis of Competing Double Auction Marketplaces Using Fictitious Play
In this paper, we analyse how traders select marketplaces and bid in a setting with multiple competing marketplaces. Specifically, we use a fictitious play algorithm to analyse the...
Bing Shi, Enrico H. Gerding, Perukrishnen Vyteling...
IEEEARES
2010
IEEE
14 years 9 months ago
Using Smart Cards for Tamper-Proof Timestamps on Untrusted Clients
Online auctions of governmental bonds and CO2 certificates are challenged by high availability requirements in face of high peak loads around the auction deadline. Traditionally, t...
Guenther Starnberger, Lorenz Froihofer, Karl M. G&...
IJCAI
2007
15 years 1 months ago
Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control
We study auction-like algorithms for the distributed allocation of tasks to cooperating agents. To reduce the team cost of sequential single-item auction algorithms, we generalize...
Sven Koenig, Craig A. Tovey, Xiaoming Zheng, Ilgaz...