Sciweavers

50 search results - page 7 / 10
» Fairness in Combinatorial Auctioning Systems
Sort
View
CORR
2010
Springer
76views Education» more  CORR 2010»
15 years 6 months ago
Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
Abstract. We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are nor...
Jeroen Ketema, Jakob Grue Simonsen
ATAL
2004
Springer
15 years 10 months ago
Anonymous Pricing of Efficient Allocations in Combinatorial Economies
Auctions and exchanges are important coordination mechanisms for multiagent systems. Most multi-good markets are combinatorial in that the agents have preferences over bundles of ...
Wolfram Conen, Tuomas Sandholm
IEEEARES
2006
IEEE
16 years 8 days ago
Fair Trading of Information: A Proposal for the Economics of Peer-to-Peer Systems
A P2P currency can be a powerful tool for promoting exchanges in a trusted way that make use of under-utilized resources both in computer networks and in real life. There are thre...
Kenji Saito, Eiichi Morino, Jun Murai
MIDDLEWARE
2007
Springer
16 years 11 days ago
Fair access to scarce resources in ad-hoc grids using an economic-based approach
In ad-hoc Grids where the availability of resources and tasks changes over the time, distributing the tasks among the scarce resources in a balanced way is a challenging task. In ...
Behnaz Pourebrahimi, Koen Bertels
SAINT
2006
IEEE
16 years 7 days ago
Fair Overload Handling Using Proof-of-Work Functions
Overload can reduce the overall performance of a computer system up to a point where the whole service might collapse. Thus, for example the load on a server must be controlled to...
Sebastian Golze, Gero Mühl