( en | de | ru )

 

Disambiguation of "Lerner, Anat"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Constrained Combinatorial Auctions.

, and . IGTR, 18 (3): 1650007:1-1650007:10 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Anat Blodinger

Silvia Julia Anatkov

Hermann Lerner

Lauy Mohammad Mahmood Anati

Ambaye Ogato Anata

 

Other publications of authors with the same name

The Incompatibility of Pareto Optimality and Dominant-Strategy Incentive Compatibility in Sufficiently-Anonymous Budget-Constrained Quasilinear Settings., and . Games, 4 (4): 690-710 (2013)Characterizing the Incentive Compatible and Pareto Optimal Efficiency Space for Two Players, k Items, Public Budget and Quasilinear Utilities., and . Games, 5 (2): 97-115 (2014)Is It a Filler or a Pause? A Quantitative Analysis of Filled Pauses in Hebrew., , and . SPECOM, volume 12997 of Lecture Notes in Computer Science, page 638-648. Springer, (2021)A Storyteller's Tale: Literature Audiobooks Genre Classification Using CNN and RNN Architectures., , , and . INTERSPEECH, page 3387-3390. ISCA, (2019)Chord Rooted Forest Algorithm for Data Grid Search., and . GCA, page 63-69. CSREA Press, (2007)The Influence of the Interlocutor's Gender on the Speaker's Role Identification., , , and . SPECOM, volume 11096 of Lecture Notes in Computer Science, page 321-330. Springer, (2018)MMM: multi-channel TDMA with MPR capabilities for MANETs., , and . Wireless Networks, 19 (3): 323-330 (2013)Towards Characterizing the Deterministic Combinatorial Constrained Efficient Space., and . ADT, volume 11834 of Lecture Notes in Computer Science, page 32-48. Springer, (2019)Efficient Constrained Combinatorial Auctions., and . IGTR, 18 (3): 1650007:1-1650007:10 (2016)Characterizing incentive compatible, Pareto optimal and sufficiently anonymous constrained combinatorial mechanisms - Two players case., and . Comput., 6 (2): 183-208 (2017)