arXiv subjects

Ephraim Zehavi

Publications and source records attributed to Ephraim Zehavi.

4 recordsLinked to original sources

arXiv2016

On the allocation of multiple divisible assets to players with different utilities

When there is a dispute between players on how to divide multiple divisible assets, how should it be resolved? In this paper we introduce a multi-asset game model that enables cooperation between multiple agents who bargain on sharing K assets, when each player has a different value for each asset. It thus extends the sequential discrete Raiffa solution and the Talmud rule solution to multi-asset cases. keyword: resource allocation, game theory, Raiffa Bargaining Solution, Aumann Bankruptcy, non-transferable commodities

cs.GT↗

arXiv2014

Network coding for multicasting over Rayleigh fading multi access channels

This paper examines the problem of rate allocation for multicasting over slow Rayleigh fading channels using network coding. In the proposed model, the network is treated as a collection of Rayleigh fading multiple access channels. In this model, rate allocation scheme that is based solely on the statistics of the channels is presented. The rate allocation scheme is aimed at minimizing the outage probability. An upper bound is presented for the probability of outage in the fading multiple access channel. A suboptimal solution based on this bound is given. A distributed primal-dual gradient algorithm is derived to solve the rate allocation problem.

cs.NI↗

arXiv2009

Turbo Analog Error Correcting Codes Decodable By Linear Programming

In this paper we present a new Turbo analog error correcting coding scheme for real valued signals that are corrupted by impulsive noise. This Turbo code improves Donoho's deterministic construction by using a probabilistic approach. More specifically, our construction corrects more errors than the matrices of Donoho by allowing a vanishingly small probability of error (with the increase in block size). The problem of decoding the long block code is decoupled into two sets of parallel Linear Programming problems. This leads to a significant reduction in decoding complexity as compared to one-step Linear Programming decoding.

cs.IT↗

arXiv2006

Bargaining over the interference channel

In this paper we analyze the interference channel as a conflict situation. This viewpoint implies that certain points in the rate region are unreasonable to one of the players. Therefore these points cannot be considered achievable based on game theoretic considerations. We then propose to use Nash bargaining solution as a tool that provides preferred points on the boundary of the game theoretic rate region. We provide analysis for the 2x2 intereference channel using the FDM achievable rate region. We also outline how to generalize our results to other achievable rate regions for the interference channel as well as the multiple access channel. Keywords: Spectrum optimization, distributed coordination, game theory, interference channel, multiple access channel.

cs.IT↗