Sciweavers

260 search results - page 12 / 52
» Trading Probability for Fairness
Sort
View
IAT
2010
IEEE
13 years 5 months ago
Nash Welfare Allocation Problems: Concrete Issues
The allocation of m resources between n agents is an AI problem with a great practical interest for automated trading. The general question is how to configure the behavior of barg...
Antoine Nongaillard, Philippe Mathieu, Patricia Ev...
CORR
2010
Springer
83views Education» more  CORR 2010»
13 years 7 months ago
Utility Constrained Energy Minimization In Aloha Networks
In this paper we consider the issue of energy efficiency in random access networks and show that optimizing transmission probabilities of nodes can enhance network performance in t...
Amir Mahdi Khodaian, Babak Hossein Khalaj, Mohamma...
WINE
2009
Springer
121views Economy» more  WINE 2009»
14 years 2 months ago
Gaming Dynamic Parimutuel Markets
We study the strategic behavior of risk-neutral non-myopic agents in Dynamic Parimutuel Markets (DPM). In a DPM, agents buy or sell shares of contracts, whose future payoff in a p...
Qianya Lin, Yiling Chen
WINET
2010
105views more  WINET 2010»
13 years 6 months ago
Flow rank based probabilistic fair scheduling for wireless ad hoc networks
Fair scheduling is an ideal candidate for fair bandwidth sharing and thereby achieving fairness among the contending flows in a network. It is particularly challenging for ad hoc ...
Md. Mamun-Or-Rashid, Muhammad Mahbub Alam, Md. Abd...
INFOCOM
2000
IEEE
14 years 3 days ago
Fair Bandwidth Sharing Among Virtual Networks: A Capacity Resizing Approach
Abstract—Virtual Private Networks (VPN) and link sharing are cost effective way of realizing corporate intranets. Corporate intranets will increasingly have to provide Integrated...
Rahul Garg, Huzur Saran