Loading...
Search for:
tajik--a
0.006 seconds
A novel dual-band transmission line with equal-phase responses
, Article IEEE Transactions on Microwave Theory and Techniques ; Volume 69, Issue 2 , 2021 , Pages 1265-1272 ; 00189480 (ISSN) ; Tajik, A ; Fakharzadeh, M ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2021
Abstract
This article presents a novel dual-band transmission line (TL), consisting of a multibranch stub, which can provide equal unwrapped phases at two different frequencies. The frequency ratio can be close to one without any significant degradation in the device performance. Besides, the bandwidth of the proposed line can be manipulated at both frequencies by adjusting the design parameters. The behavior of the structure over the frequency bands is investigated theoretically, and the design procedure and relations are derived. The simulation and measurement results of a quarter-wavelength open-ended stub and a branch-line coupler (BLC) are presented and compared to verify the performance of the...
Expand the shares together: envy-free mechanisms with a small number of cuts
, Article Algorithmica ; 2018 ; 01784617 (ISSN) ; Farhadi, M ; Ghodsi, M ; Alijani, R ; Tajik, A. S ; Sharif University of Technology
Springer New York LLC
2018
Abstract
We study the problem of fair division of a heterogeneous resource among strategic players. Given a divisible heterogeneous cake, we wish to divide the cake among n players to meet these conditions: (I) every player (weakly) prefers his allocated cake to any other player’s share (such notion is known as envy-freeness), (II) the allocation is dominant strategy-proof (truthful) (III) the number of cuts made on the cake is small. We provide methods for dividing the cake under different assumptions on the valuation functions of the players. First, we suppose that the valuation function of every player is a single interval with a special property, namely ordering property. For this case, we...
Expand the shares together: envy-free mechanisms with a small number of cuts
, Article Algorithmica ; Volume 81, Issue 4 , 2019 , Pages 1728-1755 ; 01784617 (ISSN) ; Farhadi, M ; Ghodsi, M ; Alijani, R ; Tajik, A. S ; Sharif University of Technology
Springer New York LLC
2019
Abstract
We study the problem of fair division of a heterogeneous resource among strategic players. Given a divisible heterogeneous cake, we wish to divide the cake among n players to meet these conditions: (I) every player (weakly) prefers his allocated cake to any other player’s share (such notion is known as envy-freeness), (II) the allocation is dominant strategy-proof (truthful) (III) the number of cuts made on the cake is small. We provide methods for dividing the cake under different assumptions on the valuation functions of the players. First, we suppose that the valuation function of every player is a single interval with a special property, namely ordering property. For this case, we...
Envy-free mechanisms with minimum number of cuts
, Article 31st AAAI Conference on Artificial Intelligence, AAAI 2017, 4 February 2017 through 10 February 2017 ; 2017 , Pages 312-318 ; Farhadi, M ; Ghodsi, M ; Seddighin, M ; Tajik, A. S ; Amazon; Artificial Intelligence; Baidu; et al.; IBM; Tencent ; Sharif University of Technology
AAAI press
2017
Abstract
We study the problem of fair division of a heterogeneous resource among strategic players. Given a divisible heterogeneous cake, we wish to divide the cake among n players in a way that meets the following criteria: (I) every player (weakly) prefers his allocated cake to any other player's share (such notion is known as envy-freeness), (II) the mechanism is strategy-proof (truthful), and (III) the number of cuts made on the cake is minimal. We provide methods, namely expansion process and expansion process with unlocking, for dividing the cake under different assumptions on the valuation functions of the players. Copyright © 2017, Association for the Advancement of Artificial Intelligence...