( en | de | ru )

 

Disambiguation of "Sakurai, Yuko"

Author of the publication

copydeleteadd this publication to your clipboard
A Graphical Representation for Games in Partition Function Form.

, , , , and . AAAI, page 1036-1042. AAAI Press, (2015)

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.

Yoriko Sakurai

Kaneaki Sakurai

Yuko Ito

Yuko Mitsui

Yuko Egawa

 

Other publications of authors with the same name

A false-name-proof double auction protocol for arbitrary evaluation values., and . AAMAS, page 329-336. ACM, (2003)Analysis of Coalition Formation in Cooperative Games Using Crowdsourcing and Machine Learning., and . Australasian Conference on Artificial Intelligence, volume 11919 of Lecture Notes in Computer Science, page 78-88. Springer, (2019)The effect of false-name bids in combinatorial auctions: new fraud in internet auctions., , and . Games Econ. Behav., 46 (1): 174-188 (2004)Incentives in ridesharing with deficit control., , , , and . AAMAS, page 1021-1028. IFAAMAS/ACM, (2014)Incremental Set Recommendation Based on Class Differences., , , , and . PAKDD (1), volume 7301 of Lecture Notes in Computer Science, page 183-194. Springer, (2012)Bundle Design in Robust Combinatorial Auction Protocol against False-name Bids., , and . IJCAI, page 1095-1101. Morgan Kaufmann, (2001)A Pseudo-Polynomial Algorithm for Computing Power Indices in Graph-Restricted Weighted Voting Games., , , and . IJCAI, page 631-637. AAAI Press, (2015)Determining bidding strategies in sequential auctions: quasi-linear utility and budget constraints., , , and . Agents, page 83-84. ACM, (2001)Flexible Reward Plans to Elicit Truthful Predictions in Crowdsourcing., , , and . HCOMP, page 28-29. AAAI Press, (2015)Robust Combinatorial Auction Protocol against False-Name Bids., , and . AAAI/IAAI, page 110-115. AAAI Press / The MIT Press, (2000)