Makoto Yokoo

According to our database1, Makoto Yokoo
  • authored at least 247 papers between 1990 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Leximin Multiple Objective DCOPs on Factor Graphs for Preferences of Agents.
Fundam. Inform., 2018

Strategy-proof Cake Cutting Mechanisms for All-or-nothing Utility.
Fundam. Inform., 2018

Stochastic Game Modelling for Distributed Constraint Reasoning with Privacy.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

Study of Route Optimization Considering Bottlenecks and Fairness Among Partial Paths.
Proceedings of the 10th International Conference on Agents and Artificial Intelligence, 2018

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

An Algorithm for the Myerson Value in Probabilistic Graphs with an Application to Weighted Voting.
IEEE Intelligent Systems, 2017

Distributed Constraint Problems for Utilitarian Agents with Privacy Concerns, Recast as POMDPs.
CoRR, 2017

Strategy-proof school choice mechanisms with minimum quotas and initial endowments.
Artif. Intell., 2017

Coalition Structure Generation for Partition Function Games Utilizing a Concise Graphical Representation.
Proceedings of the PRIMA 2017: Principles and Practice of Multi-Agent Systems - 20th International Conference, Nice, France, October 30, 2017

Rename and False-Name Manipulations in Discrete Facility Location with Optional Preferences.
Proceedings of the PRIMA 2017: Principles and Practice of Multi-Agent Systems - 20th International Conference, Nice, France, October 30, 2017

Core Stability in Hedonic Games among Friends and Enemies: Impact of Neutrals.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Utilitarian Approach to Privacy in Distributed Constraint Optimization Problems.
Proceedings of the Thirtieth International Florida Artificial Intelligence Research Society Conference, 2017

Coalition Structure Generation and CS-core: Results on the Tractability Frontier for games represented by MC-nets.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Infinite-Horizon Proactive Dynamic DCOPs.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Weighted Matching Markets with Budget Constraints.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Manipulation of Hamming-based Approval Voting for Multiple Referenda and Committee Elections.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

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

Coalition Structure Generation Utilizing Graphical Representation of Partition Function Games.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Generalized Vickrey Auction.
Encyclopedia of Algorithms, 2016

False-Name-Proof Auction.
Encyclopedia of Algorithms, 2016

DisCSPs with Privacy Recast as Planning Problems for Utility-based Agents.
CoRR, 2016

Utilitarian Distributed Constraint Optimization Problems.
CoRR, 2016

Repeated multimarket contact with observation errors.
CoRR, 2016

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

DisCSPs with Privacy Recast as Planning Problems for Self-Interested Agents.
Proceedings of the 2016 IEEE/WIC/ACM International Conference on Web Intelligence, 2016

Individually Rational Strategy-Proof Social Choice with Exogenous Indifference Sets.
Proceedings of the PRIMA 2016: Princiles and Practice of Multi-Agent Systems, 2016

Privacité dans les DisCSP pour agents utilitaires.
Proceedings of the Systèmes Multi-Agents et simulation, 2016

Bayesian Network-Based Extension for PGP - Estimating Petition Support.
Proceedings of the Twenty-Ninth International Florida Artificial Intelligence Research Society Conference, 2016

Manipulations in Two-Agent Sequential Allocation with Random Sequences.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Attachment Centrality: An Axiomatic Approach to Connectivity in Networks.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

k-Coalitional Cooperative Games.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 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

Pareto Efficient Strategy-proof School Choice Mechanism with Minimum Quotas and Initial Endowments.
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

Proactive Dynamic Distributed Constraint Optimization.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Strategyproof Matching with Minimum Quotas and Initial Endowments: (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

False-Name-Proof Locations of Two Facilities: Economic and Algorithmic Approaches.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Proactive Dynamic DCOPs.
Proceedings of the AI for Smart Grids and Smart Buildings, 2016

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

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

Designing Matching Mechanisms under General Distributional Constraints.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Flexible Reward Plans for Crowdsourced Tasks.
Proceedings of the PRIMA 2015: Principles and Practice of Multi-Agent Systems, 2015

Leximin Asymmetric Multiple Objective DCOP on Factor Graph.
Proceedings of the PRIMA 2015: Principles and Practice of Multi-Agent Systems, 2015

Strategy-Proof Cake Cutting Mechanisms for All-or-Nothing Utility.
Proceedings of the PRIMA 2015: Principles and Practice of Multi-Agent Systems, 2015

Exchange of Indivisible Objects with Asymmetry.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

A Pseudo-Polynomial Algorithm for Computing Power Indices in Graph-Restricted Weighted Voting Games.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Flexible Reward Plans to Elicit Truthful Predictions in Crowdsourcing.
Proceedings of the Third AAAI Conference on Human Computation and Crowdsourcing, 2015

Fairness and False-Name Manipulations in Randomized Cake Cutting.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

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

Social Decision with Minimal Efficiency Loss: An Automated Mechanism Design Approach.
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

A Graphical Representation for Games in Partition Function Form.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

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

A Complexity Approach for Core-Selecting Exchange with Multiple Indivisible Goods under Lexicographic Preferences.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Leximin Multiple Objective Optimization for Preferences of Agents.
Proceedings of the PRIMA 2014: Principles and Practice of Multi-Agent Systems, 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

Predicting Own Action: Self-Fulfilling Prophecy Induced by Proper Scoring Rules.
Proceedings of the Seconf AAAI Conference on Human Computation and Crowdsourcing, 2014

False-name-proof Combinatorial Auction Design via Single-minded Decomposition.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Incentives in ridesharing with deficit control.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Optimal false-name-proof single-item redistribution mechanisms.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Open census for addressing false identity attacks in agent-based decentralized social networks.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Coexistence of utilitarian efficiency and false-name-proofness in social choice.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

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

Strategyproof Exchange with Multiple Private Endowments.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Two Case Studies for Trading Multiple Indivisible Goods with Indifferences.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
A Dynamic Programming Model for Determining Bidding Strategies in Sequential Auctions: Quasi-linear Utility and Budget Constraints
CoRR, 2013

Strategy-Proof Mechanisms for the k-Winner Selection Problem.
Proceedings of the PRIMA 2013: Principles and Practice of Multi-Agent Systems, 2013

Embedding Preference Ordering for Symmetric DCOP Solvers on Spanning Trees.
Proceedings of the PRIMA 2013: Principles and Practice of Multi-Agent Systems, 2013

DirectDemocracyP2P - Decentralized deliberative petition drives -.
Proceedings of the 13th IEEE International Conference on Peer-to-Peer Computing, 2013

Addressing False Identity Attacks in Action-Based P2P Social Networks with an Open Census.
Proceedings of the 2013 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology, 2013

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

Ability Grouping of Crowd Workers via Reward Discrimination.
Proceedings of the First AAAI Conference on Human Computation and Crowdsourcing, 2013

Quality-control mechanism utilizing worker's confidence for crowdsourced tasks.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 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 and Grid Systems, 2012

A repeated game approach for analyzing the collusion on selective forwarding in multihop wireless networks.
Computer Communications, 2012

Distributed Problem Solving.
AI Magazine, 2012

Distributed Search Method with Bounded Cost Vectors on Multiple Objective DCOPs.
Proceedings of the PRIMA 2012: Principles and Practice of Multi-Agent Systems, 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

Soft Nonlinearity Constraints and their Lower-Arity Decomposition.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

Generalized Partition Mechanism: Framework for Combining Multiple Strategy-Proof Mechanisms.
Proceedings of the 2012 IEEE/WIC/ACM International Conferences on Intelligent Agent Technology, 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

Distributed on-Line Multi-Agent Optimization under Uncertainty: Balancing Exploration and Exploitation.
Advances in Complex Systems, 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

The Design of Cryptographic S-Boxes Using CSPs.
Proceedings of the Principles and Practice of Constraint Programming - CP 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

Reducing the Search Space of Resource Constrained DCOPs.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

Concise characteristic function representations in coalitional games based on agent types.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 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
Introducing communication in Dis-POMDPs with locality of interaction.
Web Intelligence and Agent Systems, 2010

Keyword auction protocol for dynamically adjusting the number of advertisements.
Web Intelligence and Agent Systems, 2010

Balancing local resources and global goals in multiply-constrained DCOP.
Multiagent and Grid Systems, 2010

Using Mechanism Design to Prevent False-Name Manipulations.
AI Magazine, 2010

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

Effect of DisCSP Variable-Ordering Heuristics in Scale-Free Networks.
Proceedings of the Principles and Practice of Multi-Agent Systems, 2010

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

False-name-Proof Combinatorial Auction Mechanisms.
Proceedings of the Computational Foundations of Social Choice, 07.03. - 12.03.2010, 2010

When should there be a "Me" in "Team"?: distributed multi-agent optimization under uncertainty.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

A quantified distributed constraint optimization problem.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 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
Distributed Constraint Reasoning.
Proceedings of the Encyclopedia of Artificial Intelligence (3 Volumes), 2009

Coordination Planning: Applying Control Synthesis Methods for a Class of Distributed Agents.
IEEE Trans. Contr. Sys. Techn., 2009

ADOPT-ing: unifying asynchronous distributed optimization with asynchronous backtracking.
Autonomous Agents and Multi-Agent Systems, 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

DCOPs Meet the Real World: Exploring Unknown Reward Matrices with Applications to Mobile Sensor Networks.
Proceedings of the IJCAI 2009, 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

Directed soft arc consistency in pseudo trees.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

Adaptive price update in distributed Lagrangian relaxation protocol.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008
Generalized Vickrey Auction.
Proceedings of the Encyclopedia of Algorithms, 2008

False-Name-Proof Auction.
Proceedings of the Encyclopedia of Algorithms, 2008

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

Overview of Awarded Papers - The 22nd Annual Conference of JSAI.
Proceedings of the New Frontiers in Artificial Intelligence, 2008

Network Distributed POMDP with Communication.
Proceedings of the New Frontiers in Artificial Intelligence, 2008

Introducing Communication in Dis-POMDPs with Locality of Interaction.
Proceedings of the 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2008

Constant Cost of the Computation-Unit in Efficiency Graphs for DCOP Solvers.
Proceedings of the 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 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

Keyword Auction Protocol for Dynamically Adjusting the Number of Advertisements.
Proceedings of the 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2008

Distributed Private Constraint Optimization.
Proceedings of the 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2008

Beyond quasi-linear utility: strategy/false-name-proof multi-unit auction protocols.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 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

Resource constrained distributed constraint optimization using resource constraint free pseudo-tree.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

Not all agents are equal: scaling up distributed POMDPs for agent networks.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

Resource Constrained Distributed Constraint Optimization with Virtual Variables.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
False-name bids in combinatorial auctions.
SIGecom Exchanges, 2007

Implementing a strategyproof greedy-allocation combinatorial auction and extending to ascending auction.
Systems and Computers in Japan, 2007

Determining bidding strategies in sequential auctions: Quasi-linear utility and budget constraints.
Systems and Computers in Japan, 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

Revisiting ADOPT-ing and its Feedback Schemes.
Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2007

Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies.
Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), 2007

SPIDER Attack on a Network of POMDPs: Towards Quality Bounded Solutions.
Proceedings of the Game Theoretic and Decision Theoretic Agents, 2007

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

Dynamic DFS Tree in ADOPT-ing.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
False-name-proof multi-unit auction protocol utilizing greedy allocation based on approximate evaluation values.
Systems and Computers in Japan, 2006

Theory of Internet Auctions.
Proceedings of the IEEE International Conference on Systems, 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

Winning back the CUP for distributed POMDPs: planning over continuous belief spaces.
Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), 2006

Nogood based asynchronous distributed optimization (ADOPT ng).
Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), 2006

Multiply-constrained distributed constraint optimization.
Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), 2006

Exploiting Locality of Interaction in Networked Distributed POMDPs.
Proceedings of the Distributed Plan and Schedule Management, 2006

Cooperative Team Plan: Planning, Execution, and Replanning.
Proceedings of the Distributed Plan and Schedule Management, 2006

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

2005
A combinatorial auction among experts and amateurs: The case of single-skilled experts.
Systems and Computers in Japan, 2005

Generalized Vickrey Auction and Suppression of Active Adversary Using Incentive-Compatible Implementation.
IEICE Transactions, 2005

Robust double auction protocol against false-name bids.
Decision Support Systems, 2005

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

Secure distributed constraint satisfaction: reaching agreement without revealing private information.
Artif. Intell., 2005

Adopt: asynchronous distributed constraint optimization with quality guarantees.
Artif. Intell., 2005

The distributed breakout algorithms.
Artif. Intell., 2005

Introduction: Special Issue on Distributed Constraint Satisfaction.
Artif. Intell., 2005

Strategy/False-name Proof Protocols for Combinatorial Multi-Attribute Procurement Auction.
Autonomous Agents and Multi-Agent Systems, 2005

Secure Multi-attribute Procurement Auction.
Proceedings of the Information Security Applications, 6th International Workshop, 2005

Strategy/False-Name Proof Protocols for Combinatorial Multi-attribute Procurement Auction: Handling Arbitrary Utility of the Buyer.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

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

Coalitional Games in Open Anonymous Environments.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Networked Distributed POMDPs: A Synergy of Distributed Constraint Optimization and POMDPs.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Secure Multi-attribute Procurement Auction.
Proceedings of the Financial Cryptography and Data Security, 2005

Strategy/false-name proof protocols for combinatorial multi-attribute procurement auction: handling arbitrary utility of the buyer.
Proceedings of the 4th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), 2005

Optimize My Schedule but Keep It Flexible: Distributed Multi-Criteria Coordination for Personal Assistants.
Proceedings of the Persistent Assistants: Living and Working with AI, 2005

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

Networked Distributed POMDPs: A Synthesis of Distributed Constraint Optimization and POMDPs.
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
The effect of false-name bids in combinatorial auctions: new fraud in internet auctions.
Games and Economic Behavior, 2004

Secure Generalized Vickrey Auction without Third-party Servers.
Proceedings of the Financial Cryptography, 2004

Protocol/Mechanism Design for Cooperation/Competition.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

Strategy/False-name Proof Protocols for Combinatorial Multi-Attribute Procurement Auction.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

Multiagent Planning as Control Synthesis.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

Secure Computation for Combinatorial Auctions and Market Exchanges.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

Communication for Improving Policy Computation in Distributed POMDPs.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 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

A Combinatorial Auction Protocol among Versatile Experts and Amateurs.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

2003
On market-inspired approaches to propositional satisfiability.
Artif. Intell., 2003

A robust open ascending-price multi-unit auction protocol against false-name bids.
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Characterization of Strategy/False-name Proof Combinatorial Auction Protocols: Price-oriented, Rationing-free Protocol.
Proceedings of the IJCAI-03, 2003

Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings.
Proceedings of the IJCAI-03, 2003

Secure Generalized Vickrey Auction Using Homomorphic Encryption.
Proceedings of the Financial Cryptography, 2003

False-name-proof multi-unit auction protocol utilizing greedy allocation based on approximate evaluation values.
Proceedings of the Second International Joint Conference on Autonomous Agents & Multiagent Systems, 2003

A false-name-proof double auction protocol for arbitrary evaluation values.
Proceedings of the Second International Joint Conference on Autonomous Agents & Multiagent Systems, 2003

An asynchronous complete method for distributed constraint optimization.
Proceedings of the Second International Joint Conference on Autonomous Agents & Multiagent Systems, 2003

Towards a combinatorial auction protocol among experts and amateurs: the case of single-skilled experts.
Proceedings of the Second International Joint Conference on Autonomous Agents & Multiagent Systems, 2003

2002
Defection-free exchange mechanisms based on an entry fee imposition.
Artif. Intell., 2002

False-Name-Proof Multi-unit Auction Protocol Utilizing Greedy Allocation Based on Approximate Evaluation Values.
Proceedings of the Intelligent Agents and Multi-Agent Systems, 2002

Secure Combinatorial Auctions by Dynamic Programming with Polynomial Secret Sharing.
Proceedings of the Financial Cryptography, 6th International Conference, 2002

Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information.
Proceedings of the Principles and Practice of Constraint Programming, 2002

Secure multi-agent dynamic programming based on homomorphic encryption and its application to combinatorial auctions.
Proceedings of the First International Joint Conference on Autonomous Agents & Multiagent Systems, 2002

An average-case budget-non-negative double auction protocol.
Proceedings of the First International Joint Conference on Autonomous Agents & Multiagent Systems, 2002

Designing an auction protocol under asymmetric information on nature's selection.
Proceedings of the First International Joint Conference on Autonomous Agents & Multiagent Systems, 2002

Local search for distributed SAT with complex local problems.
Proceedings of the First International Joint Conference on Autonomous Agents & Multiagent Systems, 2002

2001
Solving satisfiability problems using reconfigurable computing.
IEEE Trans. VLSI Syst., 2001

Trends of Internet Auctions and Agent-mediated Web Commerce.
New Generation Comput., 2001

Robust combinatorial auction protocol against false-name bids.
Artif. Intell., 2001

A Dynamic Programming Model for Determining Bidding Strategies in Sequential Auctions: Quasi-linear Utility and Budget Constraints.
Proceedings of the UAI '01: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, 2001

Bundle Design in Robust Combinatorial Auction Protocol against False-name Bids.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

Robust Multi-unit Auction Protocol against False-name Bids.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

On Market-Inspired Approaches to Propositional Satisfiability.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

Robust Double Auction Protocol against False-Name Bids.
Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS 2001), 2001

Determining bidding strategies in sequential auctions: quasi-linear utility and budget constraints.
Proceedings of the Fifth International Conference on Autonomous Agents, 2001

2000
Algorithms for Distributed Constraint Satisfaction: A Review.
Autonomous Agents and Multi-Agent Systems, 2000

An efficient approximate algorithm for winner determination in combinatorial auctions.
EC, 2000

Defection-Free Exchange Mechanisms for Information Goods.
Proceedings of the 4th International Conference on Multi-Agent Systems, 2000

An Approach to Over-constrained Distributed Constraint Satisfaction Problems: Distributed Hierarchical Constraint Satisfaction.
Proceedings of the 4th International Conference on Multi-Agent Systems, 2000

The Effect of False-name Declarations in Mechanism Design: Towards Collective Decision Making on the Internet.
Proceedings of the 20th International Conference on Distributed Computing Systems, 2000

The Effect of Nogood Learning in Distributed Constraint Satisfaction.
Proceedings of the 20th International Conference on Distributed Computing Systems, 2000

An Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions.
Proceedings of the Principles and Practice of Constraint Programming, 2000

The Phase Transition in Distributed Constraint Satisfaction Problems: Fist Results.
Proceedings of the Principles and Practice of Constraint Programming, 2000

Robust Combinatorial Auction Protocol against False-Name Bids.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
Socialware: Multiagent Systems for Supporting Network Communities.
Commun. ACM, 1999

Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation Heuristic.
Proceedings of the Parallel and Distributed Processing, 1999

Frequency Assignment for Cellular Mobile Systems Using Constraint Satisfaction Techniques.
Proceedings of the Principles and Practice of Constraint Programming, 1999

Solving Satisfiability Problems on FPGAs Using Experimental Unit Propagation.
Proceedings of the Principles and Practice of Constraint Programming, 1999

A Limitation of the Generalized Vickrey Auction in Electronic Commerce: Robustness against False-name Bids.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

1998
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms.
IEEE Trans. Knowl. Data Eng., 1998

Multi-state commitment search.
Proceedings of the Tenth IEEE International Conference on Tools with Artificial Intelligence, 1998

Visualizing Potential Communities: A Multiagent Approach.
Proceedings of the Third International Conference on Multiagent Systems, 1998

Distributed Constraint Satisfaction Algorithm for Complex Local Problems.
Proceedings of the Third International Conference on Multiagent Systems, 1998

Distributed Constraint Satisfaction: Foundation and Applications.
Proceedings of the Third International Conference on Multiagent Systems, 1998

Negotiations with Inaccurate Payoff Values.
Proceedings of the Third International Conference on Multiagent Systems, 1998

Solving Satisfiability Problems Using Logic Synthesis and Reconfigurable Hardware.
Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences, 1998

Supporting Network Communities with Multiagent Systems.
Proceedings of the Community Computing and Support Systems, 1998

1997
Why Adding More Constraints Makes a Problem Easier for Hill-climbing Algorithms: Analyzing Landscapes of CSPs.
Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

Distributed Partial Constraint Satisfaction Problem.
Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

1996
Solving Satisfiability Problems on FPGAs.
Proceedings of the Field-Programmable Logic, 1996

Solving Satisfiability Problems Using Field Programmable Gate Arrays: First Results.
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

1995
Asynchronous Weak-Commitment Search for Solving Large-Scale Distributed Constraint Satisfaction Problems.
Proceedings of the First International Conference on Multiagent Systems, 1995

Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems.
Proceedings of the Principles and Practice of Constraint Programming, 1995

1994
Weak-Commitment Search for Solving Constraint Satisfaction Problems.
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

1993
Constraint Relaxation in Distributed Constraint Satisfaction Problems.
Proceedings of the Fifth International Conference on Tools with Artificial Intelligence, 1993

1992
Organization Self-Design of Distributed Production Systems.
IEEE Trans. Knowl. Data Eng., 1992

Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving.
Proceedings of the 12th International Conference on Distributed Computing Systems, 1992

1990
An Organizational Approach to Adaptive Production Systems.
Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, July 29, 1990


  Loading...