Atsushi Iwasaki

Orcid: 0000-0003-0326-4303

Affiliations:
  • University of Electro-Communications, Department of Informatics, Tokyo, Japan
  • Kyushu University, Department of Intelligent Systems, Fukuoka, Japan
  • Ericsson Research, Tokyo, Japan
  • NTT Communication Science Laboratories, Kyoto, Japan
  • Kobe University, Graduate School of Science and Technology, Japan


According to our database1, Atsushi Iwasaki authored at least 90 papers between 1998 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Learning Fair Division from Bandit Feedback.
CoRR, 2023

A Slingshot Approach to Learning in Monotone Games.
CoRR, 2023

Last-Iterate Convergence with Full and Noisy Feedback in Two-Player Zero-Sum Games.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
The Reference Distributions of Maurer's Universal Statistical Test and Its Improved Tests.
IEEE Trans. Inf. Theory, 2022

Last-Iterate Convergence with Full- and Noisy-Information Feedback in Two-Player Zero-Sum Games.
CoRR, 2022

Regulating Matching Markets with Constraints: Data-driven Taxation.
CoRR, 2022

Mutation-driven follow the regularized leader for last-iterate convergence in zero-sum games.
Proceedings of the Uncertainty in Artificial Intelligence, 2022

Anytime Capacity Expansion in Medical Residency Match by Monte Carlo Tree Search.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2020
Deriving the Variance of the Discrete Fourier Transform Test Using Parseval's Theorem.
IEEE Trans. Inf. Theory, 2020

The relation between Proportion test and Uniformity test in NIST SP800-22.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Repeated Multimarket Contact with Private Monitoring: A Belief-Free Approach.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Approximately Stable Matchings with General Constraints.
CoRR, 2019

Competitive Auctions and Envy-Freeness for Group of Agents.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018
Analysis of NIST SP800-22 focusing on randomness of each sequence.
JSIAM Lett., 2018

Randomness Test to Solve Discrete Fourier Transform Test Problems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Coalition structure generation in cooperative games with compact representations.
Auton. Agents Multi Agent Syst., 2018

Repeated Triangular Trade: Sustaining Circular Cooperation with Observation Errors.
Proceedings of the PRIMA 2018: Principles and Practice of Multi-Agent Systems - 21st International Conference, Tokyo, Japan, October 29, 2018

Approximately Stable Matchings With Budget Constraints.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Study on permutation polynomials over a ring of modulo 2w and their applications to cryptography.
PhD thesis, 2017

One-stroke polynomials over a ring of modulo $2^w$.
JSIAM Lett., 2017

Controlled School Choice with Soft Bounds and Overlapping Types.
J. Artif. Intell. Res., 2017

Near-Feasible Stable Matchings with Budget Constraints.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Achieving Sustainable Cooperation in Generalized Prisoner's Dilemma with Observation Errors.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Further improving security of Vector Stream Cipher.
CoRR, 2016

Periodicity of odd degree Chebyshev polynomials over a ring of modulo $2^w$.
CoRR, 2016

Repeated multimarket contact with observation errors.
CoRR, 2016

Strategyproof matching with regional minimum and maximum quotas.
Artif. Intell., 2016

Achieving Sustainable Cooperation in Generalized Prisoner's Dilemma with Observation Errors: (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Simplifying Urban Network Security Games with Cut-Based Graph Contraction.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

How is Cooperation/collusion Sustained in Repeated Multimarket Contact with Observation Errors?: (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Strategyproof Matching with Minimum Quotas.
ACM Trans. Economics and Comput., 2015

Finding core for coalition structure utilizing dual solution.
Artif. Intell., 2015

Parametric Mechanism Design via Quantifier Elimination.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Improving Fairness in Nonwasteful Matching with Hierarchical Regional Minimum Quotas.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

How Is Cooperation/Collusion Sustained in Repeated Multimarket Contact with Observation Errors?
Proceedings of the 2015 AAAI Fall Symposia, Arlington, Virginia, USA, November 12-14, 2015, 2015

Controlled School Choice with Soft Bounds and Overlapping Types.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Computing a Payoff Division in the Least Core for MC-nets Coalitional Games.
Proceedings of the PRIMA 2014: Principles and Practice of Multi-Agent Systems, 2014

Secure (M+1) st-Price Auction with Automatic Tie-Break.
Proceedings of the Trusted Systems - 6th International Conference, 2014

Strategy-proof matching with regional minimum quotas.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013
Finding the Core for Coalition Structure Utilizing Dual Solution.
Proceedings of the 2013 IEEE/WIC/ACM International Conferences on Intelligent Agent Technology, 2013

VCG-equivalent in expectation mechanism: general framework for constructing iterative combinatorial auction mechanisms.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012
Effect of DisCSP variable-ordering heuristics in scale-free networks.
Multiagent Grid Syst., 2012

A differential game theoretic model for real-time spectrum pricing in cognitive radio networks.
Proceedings of the 37th Annual IEEE Conference on Local Computer Networks, 2012

Interactive Algorithm for Multi-Objective Constraint Optimization.
Proceedings of the Principles and Practice of Constraint Programming, 2012

Handling negative value rules in MC-net-based coalition structure generation.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Strategy-proof mechanisms for two-sided matching with minimum and maximum quotas.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

False-name-proofness in online mechanisms.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Automated equilibrium analysis of repeated games with private monitoring: a POMDP approach.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011
False-name-proof Mechanisms for Hiring a Team
CoRR, 2011

A Compact Representation Scheme of Coalitional Games Based on Multi-Terminal Zero-Suppressed Binary Decision Diagrams.
Proceedings of the Agents in Principle, Agents in Practice - 14th International Conference, 2011

Concise Characteristic Function Representations in Coalitional Games Based on Agent Types.
Proceedings of the IJCAI 2011, 2011

Generalizing Envy-Freeness toward Group of Agents.
Proceedings of the IJCAI 2011, 2011

Real-Time Solving of Quantified CSPs Based on Monte-Carlo Game Tree Search.
Proceedings of the IJCAI 2011, 2011

Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

False-name-proof mechanism design without money.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

Pseudo-tree-based algorithm for approximate distributed constraint optimization with quality bounds.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

False-name bidding in first-price combinatorial auctions with incomplete information.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

Extension of MC-net-based coalition structure generation: handling negative rules and externalities.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2010
Keyword auction protocol for dynamically adjusting the number of advertisements.
Web Intell. Agent Syst., 2010

False-Name-Proofness in Facility Location Problem on the Real Line.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Characterization of Revenue Monotonicity in Combinatorial Auctions.
Proceedings of the 2010 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2010

Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Cooperative problem solving against adversary: quantified distributed constraint satisfaction problem.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Coalition Structure Generation based on Distributed Constraint Optimization.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Characterization of Strategy-Proof, Revenue Monotone Combinatorial Auction Mechanisms and Connection with False-Name-Proofness.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Secure Keyword Auction: Preserving Privacy of Bidding Prices and CTRs.
Proceedings of the 2009 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2009

Introducing Communication in Dis-POMDPs with Finite State Machines.
Proceedings of the 2009 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2009

Coalition Structure Generation Utilizing Compact Characteristic Function Representations.
Proceedings of the Principles and Practice of Constraint Programming, 2009

Characterizing false-name-proof allocation rules in combinatorial auctions.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

Sequential partition mechanism for strongly budget-balanced redistribution.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008
Gsp-exr: gsp protocol with an exclusive right for keyword auctions.
Proceedings of the 17th International Conference on World Wide Web, 2008

Beyond Quasi-linear Utility: Strategy/False-Name-Proof Multi-unit Auction Protocols.
Proceedings of the 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2008

Anonymity-proof Shapley value: extending shapley value for coalitional games in open environments.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

2007
Implementing a strategyproof greedy-allocation combinatorial auction and extending to ascending auction.
Syst. Comput. Jpn., 2007

False-Name-Proof Mechanisms for Hiring a Team.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Multiagent Planning with Trembling-Hand Perfect Equilibrium in Multiagent POMDPs.
Proceedings of the Agent Computing and Multi-Agent Systems, 2007

Making VCG More Robust in Combinatorial Auctions via Submodular Approximation.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Payoff levels, loss avoidance, and equilibrium selection in the Stag Hunt: an experimental study.
Proceedings of the Negotiation and Market Engineering, 12.11. - 17.11.2006, 2006

False-name-proof combinatorial auction protocol: Groves Mechanism with SubModular Approximation.
Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), 2006

A Compact Representation Scheme for Coalitional Games in Open Anonymous Environments.
Proceedings of the Proceedings, 2006

2005
A robust open ascending-price multi-unit auction protocol against false-name bids.
Decis. Support Syst., 2005

A New Solution Concept for Coalitional Games in Open Anonymous Environments.
Proceedings of the New Frontiers in Artificial Intelligence, 2005

Experimental evaluations of feasibility and bottlenecks of IP<sup>2</sup> mobility management.
Proceedings of IEEE International Conference on Communications, 2005

Coalitional Games in Open Anonymous Environments.
Proceedings of the Proceedings, 2005

A New Strategy-Proof Greedy-Allocation Combinatorial Auction Protocol and Its Extension to Open Ascending Auction Protocol.
Proceedings of the Proceedings, 2005

2004
Stability of the Truth-Telling Strategy in Multi-Unit Option Allocation Auctions: Laboratory Experimentation.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

2002
Distributed adapter technology for enterprise network operations support.
Proceedings of the Management Solutions for the New Communications World, 2002

1999
Recent advances in Japanese broadcast news transcription.
Proceedings of the Sixth European Conference on Speech Communication and Technology, 1999

Message-driven speech recognition and topic-word extraction.
Proceedings of the 1999 IEEE International Conference on Acoustics, 1999

1998
Simulating a N-person Multi-stage Game for Making a State.
Proceedings of the Simulated Evolution and Learning, 1998


  Loading...