The following pages link to Makoto Yokoo (Q222880):
Displaying 47 items.
- Strategyproof matching with regional minimum and maximum quotas (Q274410) (← links)
- On market-inspired approaches to propositional satisfiability (Q814434) (← links)
- The effect of false-name bids in combinatorial auctions: new fraud in internet auctions. (Q1420521) (← links)
- Designing matching mechanisms under constraints: an approach from discrete convex analysis (Q1757595) (← links)
- Coalition structure generation for partition function games utilizing a concise graphical representation (Q2092498) (← links)
- Rename and false-name manipulations in discrete facility location with optional preferences (Q2092501) (← links)
- Measuring power in coalitional games with friends, enemies and allies (Q2093400) (← links)
- Concise integer linear programming formulation for clique partitioning problems (Q2152278) (← links)
- Impossibility of weakly stable and strategy-proof mechanism (Q2159837) (← links)
- Privacy stochastic games in distributed constraint reasoning (Q2202511) (← links)
- Competitive auctions and envy-freeness for group of agents (Q2300070) (← links)
- Attachment centrality: measure for connectivity in networks (Q2321314) (← links)
- Improved WPM encoding for coalition structure generation under MC-nets (Q2331103) (← links)
- Strategy-proof school choice mechanisms with minimum quotas and initial endowments (Q2409677) (← links)
- The distributed breakout algorithms (Q2457700) (← links)
- Adopt: asynchronous distributed constraint optimization with quality guarantees (Q2457704) (← links)
- Secure distributed constraint satisfaction: reaching agreement without revealing private information (Q2457708) (← links)
- Strategyproof allocation mechanisms with endowments and M-convex distributional constraints (Q2680800) (← links)
- Lazy Gale-Shapley for many-to-one matching with partial information (Q2695460) (← links)
- (Q2704802) (← links)
- Controlled School Choice with Soft Bounds and Overlapping Types (Q2962569) (← links)
- Secure Combinatorial Auctions by Dynamic Programming with Polynomial Secret Sharing (Q2995361) (← links)
- Balancing local resources and global goals in multiply-constrained DCOP1 (Q3082143) (← links)
- (Q3158998) (← links)
- A New Solution Concept for Coalitional Games in Open Anonymous Environments (Q3617024) (← links)
- (Q4473053) (← links)
- (Q4473059) (← links)
- A Complexity Approach for Core-Selecting Exchange under Conditionally Lexicographic Preferences (Q4558795) (← links)
- Individually Rational Strategy-Proof Social Choice with Exogenous Indifference Sets (Q4571145) (← links)
- Strategy-proof Cake Cutting Mechanisms for All-or-nothing Utility (Q4637869) (← links)
- Leximin Multiple Objective DCOPs on Factor Graphs for Preferences of Agents (Q4637870) (← links)
- Financial Cryptography (Q4680923) (← links)
- (Q4708087) (← links)
- Leximin Asymmetric Multiple Objective Distributed Constraint Optimization Problem (Q4973844) (← links)
- Split manipulations in cost sharing of minimum cost spanning tree (Q4999236) (← links)
- False-Name-Proof Facility Location on Discrete Structures. (Q4999238) (← links)
- Proactive Dynamic Distributed Constraint Optimization Problems (Q5094012) (← links)
- Weighted Matching Markets with Budget Constraints (Q5227491) (← links)
- (Q5283055) (← links)
- Financial Cryptography and Data Security (Q5712260) (← links)
- Computer Aided Verification (Q5900594) (← links)
- Robust combinatorial auction protocol against false-name bids (Q5941555) (← links)
- Trends of internet auctions and agent-mediated web commerce (Q5952498) (← links)
- Strategyproof mechanism for two-sided matching with resource allocation (Q6098859) (← links)
- A fair and truthful mechanism with limited subsidy (Q6494252) (← links)
- Subtraction games in more than one dimension (Q6512125) (← links)
- Subtraction games in more than one dimension (Q6614015) (← links)
